Abstract
In 2012, New Orleans Recovery School District (RSD) became the first U.S. district to unify charter and traditional public school admissions in a single-offer assignment mechanism known as OneApp. The RSD also became the first district to use a mechanism based on Top Trading Cycles (TTC) in a real-life allocation problem. Since TTC was originally devised for settings in which agents have endowments, there is no formal rationale for TTC in school choice. In particular, TTC is a Pareto efficient and strategy-proof mechanism, but so are other mechanisms. We show that TTC is constrained-optimal in the following sense: TTC minimizes justified envy among all Pareto efficient and strategy-proof mechanisms when each school has one seat. When schools have more than one seat, there are multiple possible implementations of TTC. Data from New Orleans and Boston indicate that there is little difference across these versions of TTC, but significantly less justified envy compared to a serial dictatorship.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
