Minimizing Justified Envy in School Choice: The Design of New Orleans' OneApp
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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
|Date of creation:||Mar 2017|
|Contact details of provider:|| Postal: National Bureau of Economic Research, 1050 Massachusetts Avenue Cambridge, MA 02138, U.S.A.|
Web page: http://www.nber.org
More information through EDIRC
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.:
- Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004.
The Quarterly Journal of Economics,
Oxford University Press, vol. 119(2), pages 457-488.
- Alvin E. Roth & Tayfun Sonmez & M. Utku Unver, 2003. "Kidney Exchange," Game Theory and Information 0308002, EconWPA.
- Roth, Alvin & Ãœnver, M. Utku & SÃ¶nmez, Tayfun, 2004. "Kidney Exchange," Scholarly Articles 2580565, Harvard University Department of Economics.
- Alvin E. Roth & Tayfun Sonmez & M. Utku Unver, 2003. "Kidney Exchange," NBER Working Papers 10002, National Bureau of Economic Research, Inc.
- Parag A. Pathak, 2011. "The Mechanism Design Approach to Student Assignment," Annual Review of Economics, Annual Reviews, vol. 3(1), pages 513-536, 09.
- Atila Abdulkadiroglu & Tayfun Sonmez, 1998. "Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems," Econometrica, Econometric Society, vol. 66(3), pages 689-702, May.
- Alcalde, Jose & Barbera, Salvador, 1994. "Top Dominance and the Possibility of Strategy-Proof Stable Solutions to Matching Problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 4(3), pages 417-435, May.
- Alcalde, J. & Barberà, S., 1992. "Top Dominance and the Possibility of Strategy-Proof Stable Solutions to Matching Problems," UFAE and IAE Working Papers 196.92, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Umut M. Dur & Scott Duke Kominers & Parag A. Pathak & Tayfun Sönmez, 2013. "The Demise of Walk Zones in Boston: Priorities vs. Precedence in School Choice," NBER Working Papers 18981, National Bureau of Economic Research, Inc.
- Hakimov, Rustamdjan & Kesten, Onur, 2014. "The equitable top trading cycles mechanism for school choice," Discussion Papers, Research Unit: Market Behavior SP II 2014-210, Social Science Research Center Berlin (WZB).
- Ehlers, Lars & Svensson, Lars-Gunnar & Andersson, Tommy, 2014. "Budget-balance, fairness and minimal manipulability," Theoretical Economics, Econometric Society, vol. 9(3), September.
- Andersson, Tommy & Svensson, Lars-Gunnar & Ehlers, Lars, 2010. "Budget-Balance, Fairness and Minimal Manipulability," Working Papers 2010:16, Lund University, Department of Economics, revised 15 Jan 2013.
- ANDERSSON, Tommy & EHLERS, Lars & SVENSSON, Lars-Gunnar, 2010. "Budget-Balance, Fairness and Minimal Manipulability," Cahiers de recherche 2010-09, Universite de Montreal, Departement de sciences economiques.
- ANDERSSON, Tommy & EHLERS, Lars & SVENSSON, Lars-Gunnar, 2010. "Budget-Balance, Fairness and Minimal Manipulability," Cahiers de recherche 18-2010, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
- Arribillaga, R. Pablo & Massó, Jordi, 2016. "Comparing generalized median voter schemes according to their manipulability," Theoretical Economics, Econometric Society, vol. 11(2), May.
- R. Pablo Arribillaga & Jordi Massó, 2014. "Comparing Generalized Median Voter Schemes According to their Manipulability," UFAE and IAE Working Papers 946.14, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- R. Pablo Arribillaga & Jordi Massó, 2014. "Comparing Generalized Median Voter Schemes According to their Manipulability," Working Papers 753, Barcelona Graduate School of Economics.
- Dur, Umut, 2012. "A Characterization of the Top Trading Cycles Mechanism for the School Choice Problem," MPRA Paper 41366, University Library of Munich, Germany.
- Ma, Jinpeng, 1994. "Strategy-Proofness and the Strict Core in a Market with Indivisibilities," International Journal of Game Theory, Springer;Game Theory Society, vol. 23(1), pages 75-83. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:nbr:nberwo:23265. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.