An incompatibility between recursive unanimity and strategy-proofness in two-sided matching problems
AbstractIn this article, we study the incompatibilities for the properties on matching rules in two-sided many-to-one matching problems under responsive preferences. We define a new property called respect for recursive unanimity. This property requires that if every agent matches with its first choice among its really possible choices that are based on a recursive procedure like the well-known top trading cycles algorithm, then we should respect it. More precisely, given a matching problem, we exclude the agents whose first choices are satisfied without any discrepancy among them, and consider the restricted matching problems of the remaining agents. If we reach a state in which all agents are excluded by repeating this procedure, then we should respect the outcome. This property is weaker than stability and is stronger than respect for unanimity (that is also known as weak unanimity). We show that there are no strategy-proof matching rules that respect recursive unanimity. Copyright Springer-Verlag 2013
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 Springer in its journal Social Choice and Welfare.
Volume (Year): 40 (2013)
Issue (Month): 2 (February)
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00355/index.htm
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.:
- Sonmez, T., 1995.
"Strategy-Proofness in Many-To-One Matching Problems,"
Papers, Michigan - Center for Research on Economic & Social Theory
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.
- Shohei Takagi & Shigehiro Serizawa, 2010. "An impossibility theorem for matching problems," Social Choice and Welfare, Springer, Springer, vol. 35(2), pages 245-266, July.
- Sasaki, Hiroo & Toda, Manabu, 1992. "Consistency and characterization of the core of two-sided matching problems," Journal of Economic Theory, Elsevier, vol. 56(1), pages 218-227, February.
- Atila Abdulkadiroglu & Parag Pathak & Alvin E. Roth & Tayfun Sonmez, 2006.
"Changing the Boston School Choice Mechanism,"
NBER Working Papers
11965, National Bureau of Economic Research, Inc.
- Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth & Tayfun Sönmez, 2006. "Changing the Boston School Choice Mechanism," Levine's Bibliography 122247000000001022, UCLA Department of Economics.
- Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth & Tayfun Sönmez, 2006. "Changing the Boston School Choice Mechanism," Boston College Working Papers in Economics 639, Boston College Department of Economics.
- Manabu Toda, 2006. "Monotonicity and Consistency in Matching Markets," International Journal of Game Theory, Springer, vol. 34(1), pages 13-31, April.
- Eeckhout, Jan, 2000. "On the uniqueness of stable marriage matchings," Economics Letters, Elsevier, vol. 69(1), pages 1-8, October.
- Atila Abdulkadiroglu & Tayfun Smez, 2003.
"School Choice: A Mechanism Design Approach,"
Discussion Papers, Columbia University, Department of Economics
0203-18, Columbia University, Department of Economics.
- Elliott Peranson & Alvin E. Roth, 1999.
"The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design,"
American Economic Review,
American Economic Association, vol. 89(4), pages 748-780, September.
- Alvin E. Roth & Elliott Peranson, 1999. "The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design," NBER Working Papers 6963, National Bureau of Economic Research, Inc.
- Roth, Alvin E., 1985. "The college admissions problem is not equivalent to the marriage problem," Journal of Economic Theory, Elsevier, vol. 36(2), pages 277-288, August.
- 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, University of Chicago Press, vol. 92(6), pages 991-1016, December.
- Balinski, Michel & Sonmez, Tayfun, 1999. "A Tale of Two Mechanisms: Student Placement," Journal of Economic Theory, Elsevier, vol. 84(1), pages 73-94, January.
- Atila Abdulkadiroğlu & Parag A. Pathak & Alvin E. Roth & Tayfun S�nmez, 2005.
"The Boston Public School Match,"
American Economic Review,
American Economic Association, vol. 95(2), pages 368-371, May.
- 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.
- Tadenuma, Koichi & Toda, Manabu, 1998. "Implementable stable solutions to pure matching problems," Mathematical Social Sciences, Elsevier, vol. 35(2), pages 121-132, March.
- Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
- Tayfun Sonmez, 1999. "Strategy-Proofness and Essentially Single-Valued Cores," Econometrica, Econometric Society, Econometric Society, vol. 67(3), pages 677-690, May.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.