Optimizing reserves in school choice: A dynamic programming approach

We introduce a new model of school choice with reserves in which asocial planner is constrained by a limited supply of reserve seats and tries to find the matching that is optimal 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 algorithm, the resulting mechanism is strategy-proof for reserve-eligible students.