Robust stability in matching markets

, ()
Additional contact information
,: Department of Economics, Stanford University

Theoretical Economics, 2011, vol. 6, issue 2

Abstract: In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even when school priorities are publicly known and only students can behave strategically, there is a priority structure for which no robustly stable mechanism exists. Our main result shows that there exists a robustly stable mechanism if and only if the priority structure of schools is acyclic (Ergin, 2002), and in that case, the student-optimal stable mechanism is the unique robustly stable mechanism.

Keywords: Matching; stability; strategy-proofness; robust stability; acyclicity (search for similar items in EconPapers)
JEL-codes: C71 C78 D71 D78 J44 (search for similar items in EconPapers)
Date: 2011-05-03
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (18)

Downloads: (external link)
http://econtheory.org/ojs/index.php/te/article/viewFile/20110257/5199/184 (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:the:publsh:780

Access Statistics for this article

Theoretical Economics is currently edited by Simon Board, Todd D. Sarver, Juuso Toikka, Rakesh Vohra, Pierre-Olivier Weill

More articles in Theoretical Economics from Econometric Society
Bibliographic data for series maintained by Martin J. Osborne ().