In 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 Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by University Library of Munich, Germany in its series MPRA Paper with number
1906.
Find related papers by JEL classification: 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
This paper has been announced in the following NEP Reports:
References listed on IDEAS 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.: