Maskin Meets Abreu and Matsushima

Yi-Chun Chen, Takashi Kunimoto, Yifei Sun and Siyang Xiong

Papers from arXiv.org

Abstract: The theory of full implementation has been criticized for using integer/modulo games which admit no equilibrium (Jackson (1992)). To address the critique, we revisit the classical Nash implementation problem due to Maskin (1999) but allow for the use of lotteries and monetary transfers as in Abreu and Matsushima (1992, 1994). We unify the two well-established but somewhat orthogonal approaches in full implementation theory. We show that Maskin monotonicity is a necessary and sufficient condition for (exact) mixed-strategy Nash implementation by a finite mechanism. In contrast to previous papers, our approach possesses the following features: finite mechanisms (with no integer or modulo game) are used; mixed strategies are handled explicitly; neither undesirable outcomes nor transfers occur in equilibrium; the size of transfers can be made arbitrarily small; and our mechanism is robust to information perturbations. Finally, our result can be extended to infinite/continuous settings and ordinal settings.

Date: 2021-10, Revised 2022-01
New Economics Papers: this item is included in nep-des, nep-gth and nep-mic
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://arxiv.org/pdf/2110.06551 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2110.06551

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().