Nash implementation via simple stochastic mechanisms: strategy space reduction
AbstractBenoît and Ok (Games Econ Behav 64:51–67, 2008 ) show that in a society with at least three agents any weakly unanimous social choice correspondence (SCC) is Maskin’s monotonic if and only if it is Nash-implementable via a simple stochastic mechanism (Benoît-Ok’s Theorem). This paper fully identifies the class of weakly unanimous SCCs that are Nash-implementable via a simple stochastic mechanism endowed with Saijo’s message space specification (Saijo in Econometrica 56:693–700, 1988 ). It is shown that this class of SCCs is equivalent to the class of SCCs that are Nash-implementable via Benoît-Ok’s Theorem. Copyright The Author(s) 2012
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Springer in its journal Review of Economic Design.
Volume (Year): 16 (2012)
Issue (Month): 4 (December)
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/10058/index.htm
Find related papers by JEL classification:
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.