Dominant strategy implementation of stable rules

Taro Kumano and Masahiro Watabe

Games and Economic Behavior, 2012, vol. 75, issue 1, 428-434

Abstract: Most priority-based assignment problems are solved using the deferred acceptance algorithm. Kojima (2010) shows that stability and nonbossiness are incompatible. We show that the deferred acceptance algorithm satisfies a weaker notion of nonbossiness for every substitutable priority structure. We also discuss the multiplicity of dominant strategy equilibria of the preference revelation game induced by the deferred acceptance algorithm. We show that even untruthful dominant strategy equilibria lead to the truthful equilibrium outcome. In other words, the deferred acceptance algorithm is dominant strategy implementable.

Keywords: Deferred acceptance algorithm; Dominant strategy implementation; Stability; Weak nonbossiness; Multiple equilibria (search for similar items in EconPapers)
JEL-codes: C62 C78 D78 (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899825611001990
Full text for ScienceDirect subscribers only

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:eee:gamebe:v:75:y:2012:i:1:p:428-434

DOI: 10.1016/j.geb.2011.11.008

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().