An Efficient, Computationally Tractable School Choice Mechanism

Andrew McLennan (), Shino Takayama () and Yuki Tamura
Additional contact information
Andrew McLennan: School of Economics, University of Queensland
Shino Takayama: School of Economics, University of Queensland

No 668, Discussion Papers Series from University of Queensland, School of Economics

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.

Keywords: School Choice; Object Allocation; Efficiency; Fairness; Strategy Proofness; Probabilistic Serial Mechanism; Hall’s Marriage Theorem.; School Choice; Object Allocation; Efficiency; Fairness; Strategy Proofness; Probabilistic Serial Mechanism; Hall’s Marriage Theorem (search for similar items in EconPapers)
Date: 2024-02
New Economics Papers: this item is included in nep-dcm and nep-ure
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://economics.uq.edu.au/files/49021/668.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:qld:uq2004:668

Access Statistics for this paper

More papers in Discussion Papers Series from University of Queensland, School of Economics Contact information at EDIRC.
Bibliographic data for series maintained by SOE IT ().