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.     

Rationalizable implementation

We consider the implementation of social choice functions under complete information in rationalizable strategies. A strict version of the monotonicity condition introduced by Maskin is necessary under the solution concept of rationalizability. Assuming the social choice function is responsive, i.e. in distinct states it selects distinct outcomes, we show that strict Maskin monotonicity is also sufficient under a mild “no worst alternative” condition. In particular, no economic condition is required. We discuss how our results extend when the social choice function is not responsive.     

Maskin's Theorem with limited veto power

We weaken the no-veto power condition of Maskin [Maskin, E.,1999. Nash equilibrium and welfare optimality. Rev. Econ. Stud. 66, 23–38] to limited veto power, and prove that any monotonic social choice rule is Nash implementable if it satisfies this weaker condition. The result is obtained by using the canonical Maskin mechanism without modification. An immediate corollary is that the weak core is Nash implementable in any coalitional game environment. An example is given to show that the strong core need not be implementable, even when it is monotonic.     

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.     

Nash implementing non-monotonic social choice rules by awards

Summary. By a slight generalization of the definition of implementation (called implementation by awards), Maskin monotonicity is no more needed for Nash implementation. In fact, a weaker condition, to which we refer as almost monotonicity is both necessary and sufficient for social choice correspondences to be Nash implementable by awards. Hence our framework paves the way to the Nash implementation of social choice rules which otherwise fail to be Nash implementable. In particular, the Pareto social choice rule, the majority rule and the strong core are almost monotonic (hence Nash implementable by awards) while they are not Maskin monotonic (hence fail to be Nash implementable in the standard framework).Received: 12 April 2004, Revised: 18 March 2005, JEL Classification Numbers: D 79.I thank François Maniquet, Efe Ok and Ipek Ozkal-Sanver for their valuable contributions. The paper is part of a project on Electoral System Design supported by Bilgi University Research Fund.     

An alternative characterization of top trading cycles

This paper introduces two new characterizations of the top trading cycles algorithm. The key to our characterizations is a new condition, independence of irrelevant rankings (IIR). Intuitively, a mechanism satisfies IIR if whenever an agent’s ranking at an object is irrelevant to her assignment, then it is irrelevant to the assignment of all agents. We demonstrate that a mechanism is Pareto efficient, strategy-proof, IIR, and satisfies mutual best if and only if it is top trading cycles. This provides a new insight into what distinguishes top trading cycles from all other efficient and strategy-proof assignment mechanisms. We provide a second characterization in terms of weak Maskin monotonicity. A mechanism satisfies Pareto efficiency, weak Maskin monotonicity, IIR, and mutual best if and only if it is top trading cycles. This allows us to directly compare top trading cycles to known characterizations of the deferred acceptance algorithm in terms of weak Maskin monotonicity.     

α‐SERIAL MECHANISMS FOR THE PROVISION OF AN EXCLUDABLE PUBLIC GOOD

We present a new class of “α‐serial mechanisms” for the provision of an excludable public good. Those mechanisms have a similar structure to the serial mechanism, but may let the non‐consumers pay a positive cost. They inherit desirable properties such as anonymity, envy‐freeness, Maskin monotonicity, and population monotonicity from the serial mechanism. We calculate the “maximal efficiency loss” and “maximal manipulation” of α‐serial mechanisms and point out a trade‐off between these two properties.     

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.     

On efficient partnership dissolution under ex post individual rationality

This paper studies ex post individually rational, efficient partnership dissolution in a setting with interdependent valuations. We derive a sufficient condition that ensures the existence of an efficient dissolution mechanism that satisfies Bayesian incentive compatibility, ex post budget balancedness, and ex post individual rationality. For equal-share partnerships, we show that our sufficient condition is satisfied for any symmetric type distribution whenever the interdependence in valuations is non-positive. This result improves former existence results, demonstrating that the stronger requirement of ex post individual rationality does not always rule out efficiency. We also show that if we allow for two-stage revelation mechanisms, in which agents report their realized payoffs from the allocation, as well as imposing penalties off the equilibrium path, efficient dissolution is always possible even when the interdependence is positive. We further discuss the possibility of efficient dissolution with ex post quitting rights.     

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.     

On the Irrelevance of Risk Attitudes in Repeated Two-Outcome Games

We study equilibrium and maximin play in supergames consisting of the sequential play of a finite collection of stage games, where each stage game has two outcomes for each player. We show that for two-player supergames in which each stage game is strictly competitive, in any Nash equilibrium of the supergame, play at each stage is a Nash equilibrium of the stage game provided preferences over certain supergame outcomes satisfy a natural monotonicity condition. In particular, equilibrium play does not depend on risk attitudes. We establish an invariance result for games with more than two players when the solution concept is subgame perfection. Journal of Economic Literature Classification Numbers: C72, C9.     

Asymmetric English auctions

This paper studies equilibria of the n-bidder single-object English, or open ascending price, auction in a setting with interdependent values and asymmetric bidders. Maskin (in: H. Siebert (Ed.), Privatization, Institut fur Weltwirtschaften der Universität Kiel, Kiel, 1992, pp. 115-136.) showed that if the values satisfy a “single crossing” condition, then the two-bidder English auction has an efficient equilibrium. In this paper, two extensions of the single crossing condition, the “average crossing” condition and the “cyclical crossing” condition, are introduced. The main result is that under either of these conditions the n-bidder English auction has an efficient equilibrium.     

Better-reply dynamics and global convergence to Nash equilibrium in aggregative games

We consider n-person games with quasi-concave payoffs that depend on a player's own action and the sum of all players' actions. We show that a discrete-time, stochastic process in which players move towards better replies—the better-reply dynamics—converges globally to a Nash equilibrium if actions are either strategic substitutes or strategic complements for all players around each Nash equilibrium that is asymptotically stable under a deterministic, adjusted best-reply dynamics. We present an example of a 2-person game with a unique equilibrium where the derivatives of the best-reply functions have different signs and the better-reply dynamics does not converge.     

Optimal combinatorial mechanism design

We consider an optimal mechanism design problem with several heterogenous objects and interdependent values. We characterize ex post incentives using an appropriate monotonicity condition and reformulate the problem in such a way that the choice of an allocation rule can be separated from the choice of the payment rule. Central to the analysis is the formulation of a regularity condition, which gives a recipe for the optimal mechanism. If the problem is regular, then an optimal mechanism can be obtained by solving a combinatorial allocation problem in which objects are allocated in a way to maximize the sum of virtual valuations. We identify conditions that imply regularity using the techniques of supermodular optimization.     

House Allocation with Transfers

We consider the Shapley–Scarf house allocation problem where monetary transfers are allowed. We characterize the class of mechanisms that are strategy-proof, ex post individually rational, ex post budget-balanced, and “collusion-proof.” In these mechanisms, the price of each object is fixed in advance, and the objects are reallocated according to the (unique) core assignment of the Shapley–Scarf economy associated with the prices. The special case in which all prices are zero is the core mechanism studied by Shapley and Scarf. Our mechanisms are compelling alternatives to the Groves mechanisms, which satisfy neither budget balance nor our condition of collusion-proofness. Journal of Economic Literature Classification Numbers: C71, C78, D71, D78, D89.     

Weak monotonicity and Bayes–Nash incentive compatibility

An allocation rule is called Bayes–Nash incentive compatible, if there exists a payment rule, such that truthful reports of agents' types form a Bayes–Nash equilibrium in the direct revelation mechanism consisting of the allocation rule and the payment rule. This paper provides a characterization of Bayes–Nash incentive compatible allocation rules in social choice settings where agents have multi-dimensional types, quasi-linear utility functions and interdependent valuations. The characterization is derived by constructing complete directed graphs on agents' type spaces with cost of manipulation as lengths of edges. Weak monotonicity of the allocation rule corresponds to the condition that all 2-cycles in these graphs have non-negative length. For the case that type spaces are convex and the valuation for each outcome is a linear function in the agent's type, we show that weak monotonicity of the allocation rule together with an integrability condition is a necessary and sufficient condition for Bayes–Nash incentive compatibility.     

p-Best response set and the robustness of equilibria to incomplete information

In this paper, we use p-best response sets—a set-valued extension of p-dominance—in order to provide a new sufficient condition for the robustness of equilibria to incomplete information: if there exists a set S which is a p-best response set with , and there exists a unique correlated equilibrium μ^* whose support is in S then μ^* is a robust Nash equilibrium.     

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.     

Collateralized Debt as the Optimal Contract

In a multiple-good risk-sharing environment with ex post private information, conditions are found under which collateralized debt is the optimal contract. The necessary and sufficient condition is that the borrower values the collateral good more highly than does the lender; otherwise the optimal contract does not resemble debt. Limited collateral can give rise to an endogenous borrowing constraint, driving a further wedge between the intertemporal marginal rates of substitution of the borrower and the lender. Journal of Economic Literature Classification Numbers: D82, G10.     

Equivalence of strong and coalition-proof Nash equilibria in games without spillovers

Summary This paper examines the conditions which guarantee that the set of coalition-proof Nash equilibria coincides with the set of strong Nash equilibria in the normal form games withoutspillovers. We find thatpopulation monotonicity properties of the payoff functions, when the payoff of a player changes monotonically when the size of the group of players choosing the same strategy increases, are crucial to obtain the equivalence of these two solution concepts. We identify the classes of games, satisfying population monotonicity properties, which yield the equivalence of the set of coalition-proof Nash equilibria and the set of strong Nash equilibria. We also provide sufficient conditions for the equivalence result even when the population monotonicity assumptions are relaxed.We wish to thank Mamoru Kaneko, Akihiko Matsui, Tomoichi Shinotsuka, Benyamin Shitoviz, Tayfun Sonmez, William Thomson, the participants of the Southeastern Economic Theory Meeting in Charlottesville and the seminars at CORE and University of Tsukuba for useful discussions and comments. Our special thanks due anonymous referee for the suggestion to add a section addressing the issue of existence of a strong Nash equilibrium.