Publication Type

Working Paper

Version

publishedVersion

Publication Date

5-2018

Abstract

We study the classical Nash implementation problem due to Maskin (1999), but allow for the use of lottery and monetary transfer as in Abreu and Matsushima (1992, 1994). We therefore unify two well-established but somewhat orthogonal approaches of implementation theory. We first show that Maskin monotonicity is a necessary and sufficient condition for pure-strategy Nash implementation by a direct mechanism. Second, taking mixed strategies into consideration, we show that Maskin monotonicity is a necessary and sufficient condition for mixed-strategy Nash implementation by a finite (albeit indirect) mechanism. Third, we extend our analysis to implementation in rationalizable strategies. In contrast to previous papers, our approach possesses many appealing features simultaneously, e.g., finite mechanisms (with no integer or modulo game) are used; mixed strategies are handled explicitly; neither transfer nor bad outcomes are used on the equilibrium path; our mechanism is robust to information perturbations; and the size of off-equilibrium transfers can be made arbitrarily small. Finally, our result can be extended to continuous settings and ordinal settings.

Discipline

Economic Theory

Research Areas

Economic Theory

First Page

1

Last Page

68

Copyright Owner and License

Authors

Download

Share

COinS