2026-09-19T09:30:06Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1272942021-07-05T14:03:20Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Dimitris Bertsimas.
Graham, Justin W.
Massachusetts Institute of Technology. Operations Research Center.
Massachusetts Institute of Technology. Operations Research Center
Sloan School of Management
2020-09-15T21:50:40Z
2020-09-15T21:50:40Z
2020
2020
https://hdl.handle.net/1721.1/127294
1191901076
Thesis: S.M., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, May, 2020
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 32-34).
An equitable and flexible mechanism for assigning students to schools is a major concern for many school districts. The school a student attends dramatically impacts the quality of education, access to resources, family and neighborhood cohesion, and transportation costs. Facing this intricate optimization problem, school districts often utilize to stable-matching techniques which only produce stable matchings that do not incorporate these different objectives; this can be expensive and inequitable. We present a new optimization model for the Stable Matching (SM) school choice problem which relies on an algorithm we call Price-Costs-Flexibility-and- Fairness (PCF2). Our model leverages techniques to balance competing objectives using mixed-integer optimization methods. We explore the trade-offs between stability, costs, and preferences and show that, surprisingly, there are stable solutions that decrease transportation costs by 8-17% over the Gale-Shapley solution.
by Justin W. Graham.
S.M.
S.M. Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center
34 pages
eng
Massachusetts Institute of Technology
MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided.
http://dspace.mit.edu/handle/1721.1/7582
Operations Research Center.
School choice : a discrete optimization approach
Thesis
application/pdf
2020-09-15T21:50:39Z
Publication
Master
Sloan
OperRes
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="a92cd2d1-cf63-4e8a-9a9b-130a820dd3a9">
<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>School choice : a discrete optimization approach</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2020</PublicationDate>
<Authors>
<Author>
<DisplayName>Graham, Justin W.</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>An equitable and flexible mechanism for assigning students to schools is a major concern for many school districts. The school a student attends dramatically impacts the quality of education, access to resources, family and neighborhood cohesion, and transportation costs. Facing this intricate optimization problem, school districts often utilize to stable-matching techniques which only produce stable matchings that do not incorporate these different objectives; this can be expensive and inequitable. We present a new optimization model for the Stable Matching (SM) school choice problem which relies on an algorithm we call Price-Costs-Flexibility-and- Fairness (PCF2). Our model leverages techniques to balance competing objectives using mixed-integer optimization methods. We explore the trade-offs between stability, costs, and preferences and show that, surprisingly, there are stable solutions that decrease transportation costs by 8-17% over the Gale-Shapley solution.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>