Research Article
A Robust Redesign of High School Match
@ARTICLE{10.4108/eai.8-8-2015.2260798, author={Sam Hwang}, title={A Robust Redesign of High School Match}, journal={EAI Endorsed Transactions on Serious Games}, volume={3}, number={11}, publisher={ACM}, journal_a={SG}, year={2015}, month={8}, keywords={school choice, boston mechanism, deferred acceptance, demand estimation, partially identied model}, doi={10.4108/eai.8-8-2015.2260798} }
- Sam Hwang
Year: 2015
A Robust Redesign of High School Match
SG
EAI
DOI: 10.4108/eai.8-8-2015.2260798
Abstract
Many school districts allow students to report their preference rankings over schools and assign as many students as possible to their reported favorite schools. However, this well-intended assignment policy, known as the Boston mechanism, creates incentives for students to misreport their true preferences. I consider the problem of estimating students' preference parameters with reported rankings under this policy. Previous literature has made strong assumptions about the who and the how. In this paper I relax these assumptions. My identifying assumptions are that 1) students may have incorrect beliefs about their assignment probabilities as long as they correctly predict to which one of any given two schools they would have lower assignment probability; and 2) when deciding which ranking to report, students adhere to a simple rule: do not put a school on your ranking unless you prefer it to higher-probability ones. I construct moment inequalities that partially identify the preference parameters and propose an estimator of a confidence region of the parameters. Finally, I apply the method to data from Seoul, Korea to compare the efficiency and inequity of the Boston mechanism with Deferred Acceptance, an alternative assignment policy without incentives to misreport. Counterfactual simulations show that the Boston mechanism is more efficient than Deferred Acceptance, but it also penalizes students who naively report their true preferences.
Copyright © 2015 S. Hwang, licensed to EAI. This is an open access article distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/3.0/), which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited.