Fair and Efficient Assignment via the Probabilistic Serial Mechanism
AbstractThis paper studies the problem of assigning a set of indivisible objects to a set of agents when monetary transfers are not allowed. We offer two characterizations of the prominent lottery assignment mechanism called the probabilistic serial. We show that it is the only mechanism satisfying non-wastefulness and ordinal fairness. Our second result shows that a direct ordinal mechanism satisfies ordinal efficiency, envy-freeness, and upper invariance if and only if it is the probabilistic serial.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Boston College Department of Economics in its series Boston College Working Papers in Economics with number 742.
Date of creation: 27 Jul 2010
Date of revision: 30 May 2011
Note: previously circulated as "The Probabilistic Serial Assignment Mechanism"
Contact details of provider:
Postal: Boston College, 140 Commonwealth Avenue, Chestnut Hill MA 02467 USA
Web page: http://fmwww.bc.edu/EC/
More information through EDIRC
Random assignment; Probabilistic serial; Ordinal efficiency; Fairness;
Find related papers by JEL classification:
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
- D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
- D78 - Microeconomics - - Analysis of Collective Decision-Making - - - Positive Analysis of Policy-Making and Implementation
This paper has been announced in the following NEP Reports:
- NEP-ALL-2010-08-06 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statistics
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F Baum).
If references are entirely missing, you can add them using this form.