Robust stability in matching markets
AbstractIn 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.
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 Econometric Society in its journal Theoretical Economics.
Volume (Year): 6 (2011)
Issue (Month): 2 (May)
Contact details of provider:
Web page: http://econtheory.org
Matching; stability; strategy-proofness; robust stability; acyclicity;
Find related papers by JEL classification:
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
- D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
- D78 - Microeconomics - - Analysis of Collective Decision-Making - - - Positive Analysis of Policy Formulation and Implementation
- J44 - Labor and Demographic Economics - - Particular Labor Markets - - - Professional Labor Markets and Occupations
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.
- Chakraborty, Archishman & Citanna, Alessandro & Ostrovsky, Michael, 2010. "Two-sided matching with interdependent values," Journal of Economic Theory, Elsevier, vol. 145(1), pages 85-105, January.
- Kumano, Taro, 2013. "Strategy-proofness and stability of the Boston mechanism: An almost impossibility result," Journal of Public Economics, Elsevier, vol. 105(C), pages 23-29.
- Afacan, Mustafa Oǧuz, 2013. "Application fee manipulations in matching markets," Journal of Mathematical Economics, Elsevier, vol. 49(6), pages 446-453.
- Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
- Oğuz Afacan, Mustafa, 2012. "Group robust stability in matching markets," Games and Economic Behavior, Elsevier, vol. 74(1), pages 394-398.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Martin J. Osborne).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.