Incontestable Assignments

Benoit Decerf, Guillaume Haeringer and Martin Van der Linden

Papers from arXiv.org

Abstract: In school districts where assignments are exclusively determined by a clearinghouse students can only appeal their assignment with a valid reason. An assignment is incontestable if it is appeal-proof. We study incontestability when students do not observe the other students' preferences and assignments. Incontestability is shown to be equivalent to individual rationality, non-wastefulness, and respect for top-priority sets (a weakening of justified envy). Stable mechanisms and those Pareto dominating them are incontestable, as well as the Top-Trading Cycle mechanism (but Boston is not). Under a mild consistency property, incontestable mechanisms are i-indinstiguishable (Li, 2017), and share similar incentive properties.

Date: 2024-01, Revised 2024-02
New Economics Papers: this item is included in nep-ure
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2401.03598 Latest version (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:arx:papers:2401.03598

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().