College Admissions under Early Decision
AbstractIn this paper, we model college admissions under early decision in a many-to-one matching framework with two periods. We show that there exists no stable matching system, involving an early decision matching rule and a regular decision matching rule, which is nonmanipulable via early decision quotas by colleges or via early decision preferences by colleges or students. We then analyze the Nash equilibria of the game, in which the preferences of colleges and students in each period are common knowledge and every college determines a quota for the early decision period given its total capacity for the two periods. Under college-optimal and student-optimal matching systems, we show that a pure strategy equilibrium may not exist. However, when colleges or students have common preferences over the other set of agents, 'terminating early decision program' becomes a weakly dominant strategy for each college if every student, choosing to act early, always applies early to his or her top choice college.
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 Bogazici University, Department of Economics in its series Working Papers with number 2008/04.
Date of creation: Apr 2008
Date of revision:
Contact details of provider:
Postal: Natuk Birkan Hall, Bebek, 34342 İstanbul
Phone: +90 (212) 359-6505
Fax: +90 (212) 287-2453
Web page: http://www.econ.boun.edu.tr/
More information through EDIRC
Other versions of this item:
- 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
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.:
- Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
- Hideo Konishi & M. Utku Unver, 2001.
"Games of Capacity Manipulation in Hospital-Intern Markets,"
Boston College Working Papers in Economics
515, Boston College Department of Economics, revised 31 Jul 2002.
- Hideo Konishi & M. Ünver, 2006. "Games of Capacity Manipulation in Hospital-intern Markets," Social Choice and Welfare, Springer, vol. 27(1), pages 3-24, August.
- 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.
- Atila Abdulkadiroglu & Tayfun Sonmez, 1998. "Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems," Econometrica, Econometric Society, vol. 66(3), pages 689-702, May.
- Christopher Avery & Mark Glickman & Caroline Hoxby & Andrew Metrick, 2004.
"A Revealed Preference Ranking of U.S. Colleges and Universities,"
NBER Working Papers
10803, National Bureau of Economic Research, Inc.
- Christopher N. Avery & Mark E. Glickman & Caroline M. Hoxby & Andrew Metrick, 2013. "A Revealed Preference Ranking of U.S. Colleges and Universities," The Quarterly Journal of Economics, Oxford University Press, vol. 128(1), pages 425-467.
- Mongell, Susan & Roth, Alvin E, 1991. "Sorority Rush as a Two-Sided Matching Mechanism," American Economic Review, American Economic Association, vol. 81(3), pages 441-64, June.
- Caroline M. Hoxby, 2000. "Benevolent Colluders? The Effects of Antitrust Action on College Financial Aid and Tuition," NBER Working Papers 7754, National Bureau of Economic Research, Inc.
- Alvin E. Roth & Uriel G. Rothblum, 1999. "Truncation Strategies in Matching Markets--In Search of Advice for Participants," Econometrica, Econometric Society, vol. 67(1), pages 21-44, January.
- Roth,Alvin E. & Sotomayor,Marilda A. Oliveira, 1992.
Cambridge University Press, number 9780521437882, October.
- Roth, Alvin E. & Sotomayor, Marilda, 1992. "Two-sided matching," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 1, chapter 16, pages 485-541 Elsevier.
- 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.
- Roth, Alvin E & Vande Vate, John H, 1991. "Incentives in Two-Sided Matching with Random Stable Mechanisms," Economic Theory, Springer, vol. 1(1), pages 31-44, January.
- Sonmez, Tayfun, 1997. "Manipulation via Capacities in Two-Sided Matching Markets," Journal of Economic Theory, Elsevier, vol. 77(1), pages 197-204, November.
- Roth, Alvin E & Xing, Xiaolin, 1994. "Jumping the Gun: Imperfections and Institutions Related to the Timing of Market Transactions," American Economic Review, American Economic Association, vol. 84(4), pages 992-1044, September.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lutfu Gozgucu).
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.