Games under the Tiered Deferred Acceptance Mechanism
Jiarui Xie

TL;DR
This paper analyzes the tiered deferred acceptance mechanism in school admissions, revealing its strategic vulnerabilities and limitations in improving student placement, with implications for policy design.
Contribution
It provides a theoretical analysis of the tiered deferred acceptance mechanism, identifying conditions for stability and revealing its strategic and practical limitations.
Findings
Merging tiers preserves equilibrium outcomes.
Within-tier acyclicity is necessary and sufficient for stability.
Tiers may not improve student quality at top schools.
Abstract
We study the tiered deferred acceptance mechanism used in school admissions, such as in China and Turkey. This mechanism partitions schools into tiers and applies the deferred acceptance algorithm within each tier. Once assigned, students cannot apply to schools in subsequent tiers. We show that this mechanism is not strategy-proof. In the induced preference revelation game, we find that merging tiers preserves all equilibrium outcomes, and within-tier acyclicity is necessary and sufficient for the mechanism to implement stable matchings. We also find that introducing tiers to the deferred acceptance mechanism may not improve student quality at top-tier schools as intended.
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.
Taxonomy
TopicsGame Theory and Applications
