Publications
Publications
- September 2019
- Operations Research Letters
Optimizing Reserves in School Choice: A Dynamic Programming Approach
By: Franklyn Wang, Ravi Jagadeesan and Scott Duke Kominers
Abstract
We introduce a new model of school choice with reserves in which a social planner is constrained by a limited supply of reserve seats and tries to find an optimal matching according to a social welfare function. We construct the optimal distribution of reserves via a quartic-time dynamic programming algorithm. Due to the modular nature of the dynamic program, the mechanism is strategy-proof for reserve-eligible students.
Keywords
Citation
Wang, Franklyn, Ravi Jagadeesan, and Scott Duke Kominers. "Optimizing Reserves in School Choice: A Dynamic Programming Approach." Operations Research Letters 47, no. 5 (September 2019): 438–446.