An efficient, computationally tractable school choice mechanism
Speaker: Andrew McLennan
Affiliation: University of Queensland
Abstract
We show that the application of the Generalized Constrained Probabilistic Serial mechanism of Balbuzanov (2022) (which generalizes the Probabilistic Serial mechanism of Bogomolnaia and Moulin (2001)) to school choice has attractive properties. The mechanism is intuitively simple, assigning to each student, at each moment in the unit interval, probability of receiving a seat in her favorite school among those that are available then. It is sd-efficient and effectively strategy proof. We provide an algorithm, based on a generalization of Hall’s marriage theorem, for computing the mechanism, which has been implemented, and seems likely to have reasonable running times even for the world’s largest school choice problems.
About Statistics, modelling and operations research seminars
Students, staff and visitors to UQ are welcome to attend our regular seminars.
The events are jointly run by our Operations research and Statistics and probability research groups.
The Statistics, modelling and operations research (SMOR) Seminar series seeks to celebrate and disseminate research and developments across the broad spectrum of quantitative sciences. The SMOR series provides a platform for communication of both theoretical and practical developments, as well as interdisciplinary topics relating to applied mathematics and statistics.
Venue
Room: 210 (and via Zoom:
https://uqz.zoom.us/j/85861107130)
