Subgame perfect implementation: A necessary and almost sufficient condition

We present a necessary and almost sufficient condition for subgame perfect implementation of social choice correspondences. In societies with at least three individuals, any social choice correspondence which satisfies no veto power and our necessary Condition α is subgame perfect implementable. Thus Condition α is analogous to monotonicity which, by Maskin's celebrated characterization, is necessary and, in a similar way, almost sufficient for Nash implementation.     

Iterated strict dominance in general games

We offer a definition of iterated elimination of strictly dominated strategies (IESDS^*) for games with (in)finite players, (non)compact strategy sets, and (dis)continuous payoff functions. IESDS^* is always a well-defined order independent procedure that can be used to solve Nash equilibrium in dominance-solvable games. We characterize IESDS^* by means of a “stability” criterion, and offer a sufficient and necessary epistemic condition for IESDS^*. We show by an example that IESDS^* may generate spurious Nash equilibria in the class of Reny's better-reply secure games. We provide sufficient/necessary conditions under which IESDS^* preserves the set of Nash equilibria.     

Iterated strict dominance in general games

We offer a definition of iterated elimination of strictly dominated strategies (IESDS^*) for games with (in)finite players, (non)compact strategy sets, and (dis)continuous payoff functions. IESDS^* is always a well-defined order independent procedure that can be used to solve Nash equilibrium in dominance-solvable games. We characterize IESDS^* by means of a “stability” criterion, and offer a sufficient and necessary epistemic condition for IESDS^*. We show by an example that IESDS^* may generate spurious Nash equilibria in the class of Reny's better-reply secure games. We provide sufficient/necessary conditions under which IESDS^* preserves the set of Nash equilibria.     

The rate of convergence to perfect competition of matching and bargaining mechanisms

We study the steady state of a market with incoming cohorts of buyers and sellers who are matched pairwise and bargain under private information. A friction parameter is τ, the length of the time period until the next meeting. We provide a necessary and sufficient condition for the convergence of mechanism outcomes to perfect competition at the linear rate in τ, which is shown to be the fastest possible among all bargaining mechanisms. The condition requires that buyers and sellers always retain some bargaining power. The bargaining mechanisms that satisfy this condition are called nonvanishing bargaining power (NBP) mechanisms. Simple random proposer take-it-or-leave-it protocols are NBP, while k-double auctions (k-DA) are not. We find that k-DAs have equilibria that converge to perfect competition at a linear rate, converge at a slower rate or even do not converge at all.     

A simple sufficient condition for strong implementation

In an important step forward Maskin [E. Maskin, Nash equilibrium and welfare optimality, Rev. Econ. Stud. 66 (1999) 23–38] showed that two properties – monotonicity and no veto power – are together sufficient for Nash implementation. In contrast to the vast literature that followed, this characterization has two major advantages: First, it is often easy to verify, and second, it has an elegant and simple interpretation. However, there does not exist a similar condition for social choice correspondences that are implementable in strong equilibrium. All existing characterizations are either hard to verify or apply only to comprehensive preference domains. In this paper we improve the situation by giving one such condition. Moreover, using well-known examples we show that this is a practical tool.     

Perfect Bayesian implementation

Summary We study Social Choice Sets (SCS) implementable as perfect Bayesian equilibria of some incomplete information extensive form game. We provide a necessary condition which we callcondition . The condition is analogous tocondition C that Moore and Repullo [1988] show to be necessary for subgame perfect implementation in games of complete information, and it is weaker than the Bayesian Monotonicity condition stated in Jackson [1991]. Our first theorem establishes that Incentive Compatibility, Closure and Condition are necessary for implementation.Our second theorem establishes sufficient conditions. We show that any SCS which satisfies Incentive Compatibility, Closure and a condition called Sequential Monotonicity No Veto (SMNV) is implementable. SMNV is similar in spirit but weaker than the Monotonicity No Veto condition stated in Jackson [1991]. It is also similar to a combination of condition and No Veto Power, which Abreau and Sen show to be sufficient for implementation in subgame perfect equilibrium.This paper is a revised version of a chapter of my dissertation at Stanford University, Graduate School of Business. I would like to thank, without implicating, Faruk Gul, Bob Wilson and especially John Roberts for their constant advice and encouragement. I would also like to thank participants at the 1993 Summer Meeting of the Econometric Society and a referee for comments leading to substantial improvement in the paper. Financial support from Bocconi University is gratefully acknowledged.     

Chores

We analyze situations where the provision of each of c public goods must be voluntarily assumed by exactly one of n private agents in the absence of transfer schemes or binding contracts. We model this problem as a complete information, potentially infinite horizon game where n agents simultaneously wage c wars of attrition. Providing a public good commits an agent not to take on the provision of another public good for a fixed period. We explore the strategic trade-offs that this commitment ability and the multiplicity of tasks provide. Subgame perfect equilibria (SPEs) are characterized completely for games with two agents and two public goods. For games with two identical agents and c > 1 identical public goods, we establish that an equilibrium that yields a surplus-maximizing outcome always exists and we provide sufficient conditions under which it is the unique equilibrium outcome. We show that under mild conditions, the surplus-maximizing SPE is the unique symmetric SPE. Journal of Economic Literature Classification Number: H41, C72, D13.     

Robust implementation in general mechanisms

A social choice function is robustly implemented if every equilibrium on every type space achieves outcomes consistent with it. We identify a robust monotonicity condition that is necessary and (with mild extra assumptions) sufficient for robust implementation.Robust monotonicity is strictly stronger than both Maskin monotonicity (necessary and almost sufficient for complete information implementation) and ex post monotonicity (necessary and almost sufficient for ex post implementation). It is equivalent to Bayesian monotonicity on all type spaces.     

An Afriat Theorem for the collective model of household consumption

We provide a nonparametric ‘revealed preference’ characterization of rational household behavior in terms of the collective consumption model, while accounting for general individual preferences that can be non-convex. Our main result is the Collective Afriat Theorem, which parallels the well-known Afriat Theorem for the unitary model. First, it provides a characterization of collectively rational consumption behavior in terms of collective Afriat inequalities. Next, it implies the Collective Axiom of Revealed Preference (CARP) as a testable necessary and sufficient condition for data consistency with collective rationality. Finally, the theorem has some interesting testability implications. With only a finite set of observations, the nature of consumption externalities (positive or negative) in the intra-household allocation process is non-testable. The same non-testability conclusion holds for privateness (with or without externalities) or publicness of consumption. By contrast, concavity of individual utility functions (representing convex preferences) turns out to be testable. In addition, monotonicity is testable for the model that assumes all household consumption is public.     

On efficiency of the English auction

We study efficiency properties of the irrevocable exit English auction in a setting with interdependent values. Maskin (1992) [1] shows that the pairwise single-crossing condition is sufficient for efficiency of the English auction with two bidders and suggests that it is also a necessary condition. This paper clarifies and extends Maskin?s results to the case of N bidders. We introduce the generalized single-crossing condition—a fairly intuitive extension of the pairwise single-crossing condition—and prove that it is essentially a necessary and sufficient condition for the existence of an efficient equilibrium of the N-bidder English auction.     

Efficiency and consistency for locating multiple public facilities

In the problem of locating multiple public facilities studied by Barberà and Beviá [Self-selection consistent functions, J. Econ. Theory 105 (2002) 263-277; Locating public facilities by majority: stability, consistency and group formation, Games Econ. Behav. 56 (2006) 185-200], we offer simple necessary and sufficient conditions for efficiency, decentralizability of efficient decisions in a game of community division and local public goods provision, and a constructive algorithm for efficient and consistent decisions.     

Convergence Results for Unanimous Voting

This paper derives a necessary condition for unanimous voting to converge to the perfect information outcome when voters are only imperfectly informed about the alternatives. Under some continuity assumptions, the condition is also sufficient for the existence of a sequence of equilibria that exhibits convergence. The requirement is equivalent to that found by Milgrom [1979, Econometrica47, 679-688] for information aggregation in single-prize auctions. An example illustrates that convergence may be reasonably fast for small committees. However, if voters have common preferences, unanimity is not the optimal voting rule. Unanimity rule makes sense only as a way to ensure minority views are respected. Journal of Economic Literature Classification Numbers: D72, D82, D44.     

When is multidimensional screening a convex program?

A principal wishes to transact business with a multidimensional distribution of agents whose preferences are known only in the aggregate. Assuming a twist (= generalized Spence-Mirrlees single-crossing) hypothesis, quasi-linear utilities, and that agents can choose only pure strategies, we identify a structural condition on the value b(x,y) of product type y to agent type x — and on the principal?s costs c(y) — which is necessary and sufficient for reducing the profit maximization problem faced by the principal to a convex program. This is a key step toward making the principal?s problem theoretically and computationally tractable; in particular, it allows us to derive uniqueness and stability of the principal?s optimal strategy — and similarly of the strategy maximizing the expected welfare of the agents when the principal?s profitability is constrained. We call this condition non-negative cross-curvature: it is also (i) necessary and sufficient to guarantee convexity of the set of b-convex functions, (ii) invariant under reparametrization of agent and/or product types by diffeomorphisms, and (iii) a strengthening of Ma, Trudinger and Wang?s necessary and sufficient condition (A3w) for continuity of the correspondence between an exogenously prescribed distribution of agents and of products. We derive the persistence of economic effects such as the desirability for a monopoly to establish prices so high they effectively exclude a positive fraction of its potential customers, in nearly the full range of non-negatively cross-curved models.     

A unified treatment of finite and infinite economies: limited arbitrage is necessary and sufficient for the existence of equilibrium and the core

Summary. A single condition, limited arbitrage, is shown to be necessary and sufficient for the existence of a competitive equilibrium and the core in economies with any number of markets, finite or infinite, with or without short sales. This extends earlier results of Chichilnisky [8] for finite economies. This unification of finite and infinite economies is achieved by proving that in Hilbert spaces limited arbitrage is necessary and sufficient for the compactness of the Pareto frontier. Limited arbitrage has also been shown to be necessary and sufficient for a resolution of the social choice paradox [9], [10], [12], [13], [14]. Received: August 4, 1995; revised version: April 11, 1997     

Implementation with partial provability

We extend implementation theory by allowing the social choice function to depend on more than just the preferences of the agents and allowing agents to support their statements with hard evidence. We show that a simple condition on evidence is necessary for the implementation of a social choice function f when the preferences of the agents are state independent and sufficient for implementation for any preferences (including state dependent) with at least three agents if the social planner can perform small monetary transfers beyond those called for by f. If transfers can be large, f can be implemented in a game with perfect information when there are at least two players under a boundedness assumption. For both results, transfers only occur out of equilibrium. The use of evidence enables implementation which is robust in the sense that the planner needs little information about agents? preferences or beliefs and agents need little information about each others? preferences. Our results are robust to evidence forgery at any strictly positive cost.     

Iterated potential and robustness of equilibria

For any given set-valued solution concept, it is possible to consider iterative elimination of actions outside the solution set. This paper applies such a procedure to define the concept of iterated monotone potential maximizer (iterated MP-maximizer). It is shown that under some monotonicity conditions, an iterated MP-maximizer is robust to incomplete information [A. Kajii, S. Morris, The robustness of equilibria to incomplete information, Econometrica 65 (1997) 1283-1309] and absorbing and globally accessible under perfect foresight dynamics for a small friction [A. Matsui, K. Matsuyama, An approach to equilibrium selection, J. Econ. Theory 65 (1995) 415-434]. Several simple sufficient conditions under which a game has an iterated MP-maximizer are also provided.     

Sequentially consistent rules of choice under complete uncertainty

This work analyzes the problem of individual choice under complete uncertainty. In this context, each alternative action consists of a set of different possible outcomes with no associated probability distribution. The work examines and defines a class of rules such that: (a) the evaluation of sets (actions) follows a certain procedural pattern; and (b) an assumption of sequential contraction consistency, which is an adaptation of Sen's α condition, is satisfied. In this framework, some results of characterization show that several well-known rules for comparing sets of outcomes can be reinterpreted in procedural terms.     

Market structure and matching with contracts

Ostrovsky (2008) [9] develops a theory of stability for a model of matching in exogenously given networks. For this model a generalization of pairwise stability, chain stability, can always be satisfied as long as agents' preferences satisfy same side substitutability and cross side complementarity. Given this preference domain I analyze the interplay between properties of the network structure and (cooperative) solution concepts. The main structural condition is an acyclicity notion that rules out the implementation of trading cycles. It is shown that this condition and the restriction that no pair of agents can sign more than one contract with each other are jointly necessary and sufficient for (i) the equivalence of group and chain stability, (ii) the core stability of chain stable networks, (iii) the efficiency of chain stable networks, (iv) the existence of a group stable network, and (v) the existence of an efficient and individually stable network. These equivalences also provide a rationale for chain stability in the unrestricted model. The (more restrictive) conditions under which chain stability coincides with the core are also characterized.     

The α-MEU model: A comment

In Ghirardato et al. (2004) [7], Ghirardato, Macheroni and Marinacci propose a method for distinguishing between perceived ambiguity and the decision-maker?s reaction to it. They study a general class of preferences which they refer to as invariant biseparable. This class includes CEU and MEU. They axiomatize a subclass of α-MEU preferences. If attention is restricted to finite state spaces, we show that any α-MEU preference relation, satisfies GMM?s axioms if and only ifα=0 or 1, that is, the preferences must be either maxmin or maxmax. We show by example that these axioms may be satisfied when the state space is [0,1].     

Bargaining one-dimensional social choices

We analyze bargaining over the one-dimension characteristic of a public good among n impatient players when decisions require q favorable votes, q?2. Stationary subgame perfect equilibrium strategies are characterized for all games with deterministic protocol. We provide a monotonicity condition (satisfied by all single-peak, strictly quasi-concave and concave utilities) that assures uniqueness for every q whenever player's utilities are symmetric around the peak. Without symmetry, the monotonicity condition assures uniqueness for qualified majorities, q>n/2, provided that agents are sufficiently patient and utilities satisfy an additional regularity condition. Asymptotic uniqueness is assured for qualified majorities by imposing only the monotonicity condition.