Dynamic Matching in School Choice: Efficient Seat Reassignment after Late Cancellations

Опубликовано 14 мая 2018, 17:20

As market design theory increasingly shapes the design and operations of real-life marketplaces, it is important for designers to provide simple policy levers that practitioners can use to optimize platform objectives. In the school choice market, where scarce public school seats are assigned to students, a key operational issue is how to reassign seats that are vacated after an initial round of centralized assignment. Practical solutions to the reassignment problem must be simple to implement, truthful, efficient and fair while also alleviating costly student movement between schools.

In this talk, I will propose and axiomatically justify a class of reassignment mechanisms, the Permuted Lottery Deferred Acceptance (PLDA) mechanisms. Our mechanisms generalize the commonly used Deferred Acceptance (DA) school choice mechanism to a two-round setting and retain its desirable incentive, fairness and efficiency properties. School choice systems typically run Deferred Acceptance with a lottery number assigned to each student to break ties in school priorities. I will show that under natural conditions on demand, correlating the tie-breaking lotteries across rounds preserves allocative welfare, and reversing the first-round lottery order minimizes reassignment among all PLDA mechanisms. Empirical investigations based on data from NYC high school admissions support our theoretical findings.

This is based on joint work with Itai Feigenbaum, Yash Kanoria, and Jay Sethuraman.

See more at microsoft.com/en-us/research/v...