Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/150220 
Year of Publication: 
2014
Citation: 
[Journal:] Theoretical Economics [ISSN:] 1555-7561 [Volume:] 9 [Issue:] 1 [Publisher:] The Econometric Society [Place:] New Haven, CT [Year:] 2014 [Pages:] 253-277
Publisher: 
The Econometric Society, New Haven, CT
Abstract: 
This paper studies the problem of assigning a set of indivisible objects to a set of agents when monetary transfers are not allowed and agents reveal only ordinal preferences, but random assignments are possible. We offer two characterizations of the probabilistic serial mechanism, which assigns lotteries over objects. We show that it is the only mechanism satisfying non-wastefulness and ordinal fairness and the only mechanism satisfying sd-efficiency, sd-envy-freeness, and weak invariance or weak truncation robustness (where “sd” stands for first-order stochastic dominance).
Subjects: 
Random assignment
probabilistic serial
ordinal fairness
sd-efficiency
sd-envy-freeness
JEL: 
C71
C78
D71
D78
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by-nc Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.