Very little is known about the student-optimal stable mechanism when school priorities are weak. In current practice, the student proposing deferred acceptance algorithm is applied after indifferences in priority orders are broken with a lottery. Although such a tie-breaking procedure preserves stability, it adversely affects the welfare of the students since it introduces artificial stability constraints. We propose a simple procedure to compute a student-optimal stable matching when priorities are weak. The idea behind our construction relies on a new notion which we call a stable improvement cycle. Abdulkadiroglu, Pathak, and Roth (2006) report that had our algorithm been applied to the preference data of the 2003-2004 New York City High School Match, 6,854 students (10.5% of the 63,795 matched students) would have been matched with schools higher on their preference lists without hurting the others. We run simulations to understand the qualitative effects of correlation in preferences and of locational preference on the size of the efficiency gain. We also investigate the strategic properties of the class of student-optimal stable mechanisms.
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 of Oxford, Department of Economics in its series Economics Series Working Papers with number
349.
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.: