2026-09-18T18:39:01Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1050022026-06-17T14:46:02Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Itai Ashlagi.
Shi, Peng, Ph. D. Massachusetts Institute of Technology
Massachusetts Institute of Technology. Operations Research Center.
Massachusetts Institute of Technology. Operations Research Center
Sloan School of Management
2016-10-25T19:18:03Z
2016-10-25T19:18:03Z
2016
2016
http://hdl.handle.net/1721.1/105002
960816448
Thesis: Ph. D., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2016.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 243-250).
In this thesis, I study how data-driven optimization can be used to improve school choice. In a typical school choice system, each student receives a set of school options, called the student's menu. Based on his/her menu, each student submits a preference ranking of schools in the menu. Based on the submitted preferences, a centralized algorithm determines the assignment. In Boston, New York City, Chicago, Denver, New Orleans,Washington DC, among other cities, the assignment algorithm is the student-proposing deferred acceptance (DA) algorithm, which can also incorporate a priority for each student at each school. These priorities may contain a deterministic as well as a random component. An advantage of this algorithm is incentive-compatibility, meaning that no student has incentives to misreport his/her preferences. The first research question of this thesis is how to optimize the menus and priorities so that students have equitable chances to go to the schools they want, while the city's school busing costs are controlled. The second question is how the assignment algorithm can be modified to keep the same assignment probability of every student to every school, while improving neighbors' chances of going to the same school. To answer these questions, I build a multinomial logit (MNL) model to predict how students will rank schools under new menus, and validate the predictive accuracy of this model out of sample. I also propose a simple plan for menus and priorities, called the Home-Based plan, and compare with other proposals using the MNL model. (As a result of this analysis, the Home-Based plan was adopted by Boston in 2013.) I then show how one can further optimize the menus and priorities under the MNL model, by developing a new theoretical connection between stable matching and assortment planning, as well as methodologies on solving a new type of assortment planning problem, in which the objective is social welfare rather than revenue. Finally, I show how to further optimize the correlations between students' assignments to improve neighbors' chances of going to the same school.
by Peng Shi.
Ph.D.
250 pages
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Operations Research Center.
Prediction and optimization in school choice
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="b5585a45-45e1-498e-8745-ef2a4c6cb724">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Prediction and optimization in school choice</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2016</PublicationDate>
<Authors>
<Author>
<DisplayName>Shi, Peng, Ph. D. Massachusetts Institute of Technology</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Operations Research Center.</Keyword>
<Abstract>In this thesis, I study how data-driven optimization can be used to improve school choice. In a typical school choice system, each student receives a set of school options, called the student's menu. Based on his/her menu, each student submits a preference ranking of schools in the menu. Based on the submitted preferences, a centralized algorithm determines the assignment. In Boston, New York City, Chicago, Denver, New Orleans,Washington DC, among other cities, the assignment algorithm is the student-proposing deferred acceptance (DA) algorithm, which can also incorporate a priority for each student at each school. These priorities may contain a deterministic as well as a random component. An advantage of this algorithm is incentive-compatibility, meaning that no student has incentives to misreport his/her preferences. The first research question of this thesis is how to optimize the menus and priorities so that students have equitable chances to go to the schools they want, while the city's school busing costs are controlled. The second question is how the assignment algorithm can be modified to keep the same assignment probability of every student to every school, while improving neighbors' chances of going to the same school. To answer these questions, I build a multinomial logit (MNL) model to predict how students will rank schools under new menus, and validate the predictive accuracy of this model out of sample. I also propose a simple plan for menus and priorities, called the Home-Based plan, and compare with other proposals using the MNL model. (As a result of this analysis, the Home-Based plan was adopted by Boston in 2013.) I then show how one can further optimize the menus and priorities under the MNL model, by developing a new theoretical connection between stable matching and assortment planning, as well as methodologies on solving a new type of assortment planning problem, in which the objective is social welfare rather than revenue. Finally, I show how to further optimize the correlations between students' assignments to improve neighbors' chances of going to the same school.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>