Abstract
Consider the college admissions problem. Let us say that (student and college) preferences are student-oriented iff whenever two students disagree about the ranking of two colleges, each one of the two students is ranked higher by the college he prefers than the other student. We show that when preferences are oriented there is a unique stable matching, and that no other matching, stable or not, is weakly preferred by every student.
Similar content being viewed by others
References
Alcalde, J.: Exchange-proofness or divorce-proofness? Stability in one-sided matching markets. Econ. Des. 1, 275–287 (1995)
Clark, S.: The Uniqueness of Stable Matchings BE Press. Contrib. Theor. Econ. 6, 8 (2006)
Eeckhout, J.: On the uniqueness of stable marriage matchings. Econ. Lett. 69, 1–8 (2000)
Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69, 9–15 (1962)
Niederle, M., Yariv, L.: Decentralized Matching with Aligned Preferences, NBER Working Paper 14840 (2009)
Roth, A.E., Oliveira Sotomayor, M.A.: Two-Sided Matching: A Study in Game Theoretic Modeling and Analysis. Cambridge University Press, New York (1990)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Current Version: November 1, 2020. I thank Atila Abdulkadiroglu, Aram Grigoryan, Parag Pathak, Joe Root, Al Roth, and Leeat Yariv for helpful comments. Financial support from the National Science Foundation (SES-1724747) is gratefully acknowledged.
Rights and permissions
About this article
Cite this article
Reny, P.J. A simple sufficient condition for a unique and student-efficient stable matching in the college admissions problem. Econ Theory Bull 9, 7–9 (2021). https://doi.org/10.1007/s40505-020-00197-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40505-020-00197-2