We address a standard random assignment problem (Bogomolnaia and Moulin (2001)) and search forsd-strategy-proof, sd-efficient and sd-envy-free or equal-treatment-of-equals rules.Our main result is that on a connected domain (Sato (2013)),if there exists a rule satisfying these axioms, this domain is endowed with a restricted tier structure.Furthermore, we show that, on such a domain, the Probabilistic Serial rule is the unique rulethat satisfies these axioms.As an extension, we introduce outside options to the model, and establish the same characterizations.
Random Assignment, sd-strategy-proof, sd-efficient, sd-envy-free, equal-treatment-of-equals
LIU, Peng and ZENG, Huaxia.
Random assignments on preference domains with a tier structure. (2017). 1-41. Research Collection School Of Economics.
Available at: http://ink.library.smu.edu.sg/soe_research/1860
Copyright Owner and License
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.