Stability, efficiency and monotonicity in two-sided matching
Abstractwe propose a fairness property called P-monotonicity that we would like a matching mechanism to satisfy. We show that it is impossible to have a mechanism which is both stable and P- monotonic. Moreover, we show that it is impossible to have a mechanism which is both efficient and P-monotonic.
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 University Library of Munich, Germany in its series MPRA Paper with number 37215.
Date of creation: 09 Mar 2012
Date of revision:
Stability; Efficiency; Monotonicity; Two-Sided Matching;
Find related papers by JEL classification:
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
This paper has been announced in the following NEP Reports:
- NEP-ALL-2012-03-28 (All new papers)
- NEP-GTH-2012-03-28 (Game Theory)
- NEP-NET-2012-03-28 (Network Economics)
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.:
- Alvin E Roth, 2007.
"Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions,"
843644000000000283, UCLA Department of Economics.
- Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer, vol. 36(3), pages 537-569, March.
- Roth, Alvin, 2008. "Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions," Scholarly Articles 2579651, Harvard University Department of Economics.
- Alvin E. Roth, 2007. "Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions," NBER Working Papers 13225, National Bureau of Economic Research, Inc.
- Pathak, Parag A. & Abdulkadiroglu, Atila & Roth, Alvin, 2005.
"The New York City High School Match,"
2562765, Harvard University Department of Economics.
- Balinski, Michel & Sonmez, Tayfun, 1999. "A Tale of Two Mechanisms: Student Placement," Journal of Economic Theory, Elsevier, vol. 84(1), pages 73-94, January.
- Alcalde, J. & Barberà, S., 1992.
"Top Dominance and the Possibility of Strategy-Proof Stable Solutions to Matching Problems,"
UFAE and IAE Working Papers
196.92, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Alcalde, Jose & Barbera, Salvador, 1994. "Top Dominance and the Possibility of Strategy-Proof Stable Solutions to Matching Problems," Economic Theory, Springer, vol. 4(3), pages 417-35, May.
- Sonmez, T., 1995.
"Strategy-Proofness in Many-To-One Matching Problems,"
95-01, Michigan - Center for Research on Economic & Social Theory.
- Tayfun Sönmez, 1994. "Strategy-proofness in many-to-one matching problems," Review of Economic Design, Springer, vol. 1(1), pages 365-380, December.
- Atila Abdulkadiroglu & Tayfun Smez, 2003.
"School Choice: A Mechanism Design Approach,"
0203-18, Columbia University, Department of Economics.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ekkehart Schlicht).
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.