Constrained school choiceGuillaume Haeringer and Flip Klijn () Journal of Economic Theory, 2009, vol. 144, issue 5, pages 1921-1947 Abstract: Recently, several school districts in the US have adopted or consider adopting the Student-Optimal Stable mechanism or the Top Trading Cycles mechanism to assign children to public schools. There is evidence that for school districts that employ (variants of) the so-called Boston mechanism the transition would lead to efficiency gains. The first two mechanisms are strategy-proof, but in practice student assignment procedures typically impede a student to submit a preference list that contains all his acceptable schools. We study the preference revelation game where students can only declare up to a fixed number of schools to be acceptable. We focus on the stability and efficiency of the Nash equilibrium outcomes. Our main results identify rather stringent necessary and sufficient conditions on the priorities to guarantee stability or efficiency of either of the two mechanisms. This stands in sharp contrast with the Boston mechanism which has been abandoned in many US school districts but nevertheless yields stable Nash equilibrium outcomes. Keywords: School; choice; Matching; Nash; equilibrium; Stability; Efficiency; Gale-Shapley; deferred; acceptance; algorithm; Top; Trading; Cycles; Boston; mechanism; Acyclic; priority; structure (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: http://EconPapers.repec.org/RePEc:eee:jetheo:v:144:y:2009:i:5:p:1921-1947 Access Statistics for this article Journal of Economic Theory is edited by A. Lizzeri and K. Shell More articles in Journal of Economic Theory from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
Swedish Business School at Örebro University.