Robust implementation under alternative information structures

In this paper we consider a model in which agents have complete information about their neighbours and, possibly, incomplete information about the rest of the economy. We consider two different informational frameworks. In the first, agents do not have priors about what is going on in the rest of the economy. In the second, agents are supposed to have priors about the unknown characteristics. We present a mechanism which any social choice correspondence satisfying monotonicity and no veto powet in both informational settings for every possible prior thus requiring little knowledge from the point of view of the designer of the information possesed by agents about the economy

Mechanism design with partially-specified participation games

This paper considers the implementation of an economic outcome under complete information when the strategic and informational details of the participation game are partially-specified. This means that full participation is required to be a subgame-perfect equilibrium for a large variety of extensive modifications of the simultaneous-move participation game in the same vein as Kalai [Large Robust Games, Econometrica 72 (2004) 1631-1665].mechanism design ; robust implementation ; strong Nash equilibrium ; partial subgame perfection ; collusion on participation

Secure implementation

Strategy-proofness, requiring that truth-telling be a dominant strategy, is a standard concept in social choice theory. However, this concept has serious drawbacks. In particular, many strategy-proof mechanisms have multiple Nash equilibria, some of which produce the wrong outcome. A possible solution to this problem is to require double implementation in Nash equilibrium and in dominant strategies, i.e., secure implementation. We characterize securely implementable social choice functions and investigate the connections with dominant strategy implementation and robust implementation. We show that in standard quasi-linear environments with divisible private or public goods, there exist surplus-maximizing (non-dictatorial) social choice functions that can be securely implemented.Nash implementation, robust implementation, secure implementation, strategy-proofness

Robust implementation under alternative information structures.

In this paper we consider a model in which agents have complete information about their neighbors and, possibly, incomplete information about the rest of the environment. We consider two different informational frameworks. In the firts, agents do not have priors about the relevant characteristics in the rest of the environment. In the second, agents are supposed to have priors about the unknown characteristics. We present a mechinism which implements any social choice correspondence satisfying monotonicity and no veto powe in both informational settings for every possible prior thus requiring little knowledge from the point of view ofthe desinner of the information possessed by agents about the environment.Nash implementation; Incomplete information; Local information;

Implementation in adaptive better-response dynamics: Towards a general theory of bounded rationality in mechanisms.

We study the classic implementation problem under the behavioral assumption that agents myopically adjust their actions in the direction of better-responses or bestresponses. First, we show that a necessary condition for recurrent implementation in better-response dynamics (BRD) is a small variation of Maskin monotonicity, which we call quasimonotonicity. We also provide a mechanism for implementation in BRD if the rule is quasimonotonic and excludes worst alternatives – no worst alternative (NWA). Quasimonotonicity and NWA are both necessary and sufficient for absorbing implementation in BRD. Moreover, they characterize implementation in strict Nash equilibria. Under incomplete information, incentive compatibility is necessary for any kind of stable implementation in our sense, while Bayesian quasimonotonicity is necessary for recurrent implementation in interim BRD. Both conditions are also essentially sufficient for recurrent implementation, together with a Bayesian NWA. A characterization of implementation in strict Bayesian equilibria is also provided. Partial implementation results are also obtained.Robust implementation; Bounded rationality; Evolutionary dynamics; Mechanisms;

Secure Implementation

Strategy-proofness, requiring that truth-telling is a dominant strategy, is a standard concept in social choice theory. However, this concept has serious drawbacks. In particular, many strategy-proof mechanisms have multiple Nash equilibria, some of which produce the wrong outcome. A possible solution to this problem is to require double implementation in Nash equilibrium and in dominant strategies, i.e., secure implementation. We characterize securely implementable social choice functions, and compare our results with dominant strategy implementation. In standard quasi-linear environments with divisible private or public goods, there exist Pareto efficient (non-dictatorial) social choice functions that can be securely implemented. But in the absence of side-payments, secure implementation is incompatible with Pareto efficiency.

Rationalizable Implementation

This note studies (full) implementation of social choice functions under complete information in (correlated) rationalizable strategies. The monotonicity condition shown by Maskin (1999) to be necessary for Nash implementation is also necessary under the more stringent solution concept. We show that it is also sufficient under a mild "no worst alternative" condition. In particular, no economic condition is required.Implementation, Complete information, Rationalizability, Maskin monotonicity