 Secure implementation in allotment economiesOlivier Bochet () and Toyotaka Sakai Games and Economic Behavior, 2010, vol. 68, issue 1, 35-49 Abstract: An allocation rule is securely implementable if it is strategy-proof and has no "bad" Nash equilibrium in its associated direct revelation game [Saijo, T., Sjöström, T., Yamato, T., 2007. Secure implementation. Theoretical Econ. 2, 203-229. Original work published in RIETI Discussion Paper (03-E-019), 2003]. We study this implementability notion in allotment economies with single-peaked preferences [Sprumont, Y., 1991. The division problem with single-peaked preferences: A characterization of the uniform allocation rule. Econometrica 59, 509-519]. The equal division rule and priority rules are characterized on the basis of secure implementability, which underlines a strong trade-off between efficiency and symmetry. Though the uniform rule is not securely implementable, we show that, in its direct revelation game, any "bad" Nash equilibrium is blocked by a credible coalitional deviation, and any "good" Nash equilibrium is never blocked. Thus the impossibility of securely implementing the uniform rule can be resolved by allowing pre-play communication among players. Keywords: Secure; implementation; Strategy-proofness; Uniform; rule; Priority; rule; Nash; implementation; Coalition-proof; Nash; equilibrium; Single-peaked; preference; Fair; allocation (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:gamebe:v:68:y:2010:i:1:p:35-49 Access Statistics for this article Games and Economic Behavior is currently edited by E. Kalai More articles in Games and Economic Behavior from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.