EconPapers    
Economics at your fingertips  
 

A simple random assignment problem with a unique solution

Herve Moulin and Anna Bogomolnaia

Economic Theory, 2002, vol. 19, issue 3, 623-636

Abstract: All agents have the same ordinal ranking over all objects, receiving no object (opting out) may be preferable to some objects, agents differ on which objects are worse than opting out, and the latter information is private. The Probabilistic Serial assignment, improves upon (in the Pareto sense) the Random Priority assignment, that randomly orders the agents and offers them successively the most valuable remaining object. We characterize Probabilistic Serial by efficiency in an ordinal sense, and envy-freeness. We characterize it also by ordinal efficiency, strategyproofness and equal treatment of equals.

Keywords: Random assignment; No Envy; Strategyproofness; Priority. (search for similar items in EconPapers)
JEL-codes: C78 D61 D63 (search for similar items in EconPapers)
Date: 2001-12-20
Note: Received: October 5, 1999; revised version: December 20, 2000
References: Add references at CitEc
Citations: View citations in EconPapers (18)

Downloads: (external link)
http://link.springer.de/link/service/journals/00199/papers/2019003/20190623.pdf (application/pdf)
Access to the full text of the articles in this series is restricted

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:spr:joecth:v:19:y:2002:i:3:p:623-636

Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/199/PS2

Access Statistics for this article

Economic Theory is currently edited by Nichoals Yanneils

More articles in Economic Theory from Springer, Society for the Advancement of Economic Theory (SAET) Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:joecth:v:19:y:2002:i:3:p:623-636