Robust stability in matching markets
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.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Atila Abdulkadiroğlu & Parag A. Pathak & Alvin E. Roth, 2005.
"The New York City High School Match,"
American Economic Review,
American Economic Association, vol. 95(2), pages 364-367, May.
- Alessandro Citanna & Archishman Chakraborty & Michael Ostrovsky, 2010.
"Two-sided matching with interdependent values,"
When requesting a correction, please mention this item's handle: RePEc:the:publsh:780. See general 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: (Martin J. Osborne)
If references are entirely missing, you can add them using this form.