
TL;DR
This paper introduces a straightforward polynomial-time method for creating ex ante stable school-choice lotteries that ensure equal treatment and are not dominated by other stable lotteries.
Contribution
It presents a novel, simple approach for constructing stable school-choice lotteries using ETE reassignment, ensuring fairness and efficiency.
Findings
The method guarantees ex ante stability and equal treatment.
The resulting lottery is not ordinally dominated by any other.
The approach is computationally efficient, running in polynomial time.
Abstract
This note proposes a simple polynomial-time method for constructing an ex ante stable school-choice lottery satisfying equal treatment of equals. The method applies the ETE reassignment to a constrained efficient stable matching and yields a lottery that is not ordinally dominated by any other ex ante stable lottery.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
