Group Robust Stability in Matching Markets
AbstractWe propose a group robust stability notion which requires robustness against a combined manipulation, first misreporting of preferences and then rematching, by any group of students in a school choice type of matching markets. Our first result shows that there is no group robustly stable mechanism even under acyclic priority structures (Ergin (2002)). Then, we define a weak version of group robust stability, called weak group robust stability. Our main theorem shows that there is a weakly group robustly stable mechanism if and only if the priority structure is acyclic, and in that case it coincides with the student-optimal stable mechanism. Hence this result generalizes the main theorem of Kojima (2010). Then as a real-world practice, we add uncertainty regarding an acceptance of an appeal of students to rematch after the announced matching. In that setting, we show that under some conditions along with the acyclicity, the student-optimal stable mechanism is group robustly stable under uncertainty.
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 InfoPaper provided by Stanford Institute for Economic Policy Research in its series Discussion Papers with number 09-019.
Date of creation: Jun 2010
Date of revision:
group stability mechansim; group robust stability; student-optimal stable mechanism;
Find related papers by JEL classification:
- A10 - General Economics and Teaching - - General Economics - - - General
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.:
- Ruth Martínez & Jordi Massó & Alejdanro Neme & Jorge Oviedo, 2004.
"On group strategy-proof mechanisms for a many-to-one matching model,"
International Journal of Game Theory,
Springer, vol. 33(1), pages 115-128, January.
- Ruth Mart?ez & Jordi MassóAuthor-Email: email@example.com & Alejandro Neme & Jorge Oviedo, 2003. "On group strategy-proof mechanisms for a many-to-one matching model," UFAE and IAE Working Papers 577.03, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Haluk I. Ergin, 2002. "Efficient Resource Allocation on the Basis of Priorities," Econometrica, Econometric Society, vol. 70(6), pages 2489-2497, November.
- Roth, Alvin E, 1984. "The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory," Journal of Political Economy, University of Chicago Press, vol. 92(6), pages 991-1016, December.
- 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.
- Kesten, Onur, 2006. "On two competing mechanisms for priority-based allocation problems," Journal of Economic Theory, Elsevier, vol. 127(1), pages 155-171, March.
- Paul Milgrom, 2003.
"Matching with Contracts,"
03003, Stanford University, Department of Economics.
- 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.
- Sonmez, Tayfun, 1999. "Can Pre-arranged Matches Be Avoided in Two-Sided Matching Markets?," Journal of Economic Theory, Elsevier, vol. 86(1), pages 148-156, May.
- Sonmez, Tayfun, 1997. "Manipulation via Capacities in Two-Sided Matching Markets," Journal of Economic Theory, Elsevier, vol. 77(1), pages 197-204, November.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Anne Shor).
If references are entirely missing, you can add them using this form.