Two axiomatic approaches to 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 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).
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 InfoArticle provided by Econometric Society in its journal Theoretical Economics.
Volume (Year): 9 (2014)
Issue (Month): 1 (January)
Contact details of provider:
Web page: http://econtheory.org
Random assignment; probabilistic serial; ordinal fairness; sd-efficiency; sd-envy-freeness;
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 Formulation and Implementation
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Chambers, Christopher P., 2004. "Consistency in the probabilistic assignment model," Journal of Mathematical Economics, Elsevier, vol. 40(8), pages 953-962, December.
- Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
- Kojima, Fuhito & Manea, Mihai, 2010. "Incentives in the probabilistic serial mechanism," Journal of Economic Theory, Elsevier, vol. 145(1), pages 106-123, January.
- Sonmez, Tayfun & Utku Unver, M., 2005.
"House allocation with existing tenants: an equivalence,"
Games and Economic Behavior,
Elsevier, vol. 52(1), pages 153-185, July.
- Tayfun Sönmez & M. Utku Ünver, 2001. "House Allocation with Existing Tenants: An Equivalence," Game Theory and Information 0112002, EconWPA, revised 26 Sep 2002.
- Pathak, Parag A. & Sethuraman, Jay, 2011.
"Lotteries in student assignment: An equivalence result,"
Econometric Society, vol. 6(1), January.
- Parag A. Pathak & Jay Sethuraman, 2010. "Lotteries in Student Assignment: An Equivalence Result," NBER Working Papers 16140, National Bureau of Economic Research, Inc.
- Parag A. Pathak & Tayfun Sönmez, 2011.
"School Admissions Reform in Chicago and England: Comparing Mechanisms by their Vulnerability to Manipulation,"
Boston College Working Papers in Economics
784, Boston College Department of Economics.
- Parag A. Pathak & Tayfun SÃ¶nmez, 2013. "School Admissions Reform in Chicago and England: Comparing Mechanisms by Their Vulnerability to Manipulation," American Economic Review, American Economic Association, vol. 103(1), pages 80-106, February.
- Parag A. Pathak & Tayfun Sönmez, 2011. "School Admissions Reform in Chicago and England: Comparing Mechanisms by Their Vulnerability to Manipulation," NBER Working Papers 16783, National Bureau of Economic Research, Inc.
- Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
- Aytek Erdil & Haluk Ergin, 2008.
"What's the Matter with Tie-Breaking? Improving Efficiency in School Choice,"
American Economic Review,
American Economic Association, vol. 98(3), pages 669-89, June.
- Aytek Erdil & Haluk Ergin, 2007. "What`s the Matter with Tie-breaking? Improving Efficiency in School Choice," Economics Series Working Papers 349, University of Oxford, Department of Economics.
- Athanassoglou, Stergios & Sethuraman, Jay, 2010.
"House allocation with fractional endowments,"
24351, University Library of Munich, Germany.
- Katta, Akshay-Kumar & Sethuraman, Jay, 2006. "A solution to the random assignment problem on the full preference domain," Journal of Economic Theory, Elsevier, vol. 131(1), pages 231-250, November.
- Atila Abdulkadiroglu & Tayfun Sonmez, 1998. "Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems," Econometrica, Econometric Society, vol. 66(3), pages 689-702, May.
- Abdulkadiroglu, Atila & Sonmez, Tayfun, 2003. "Ordinal efficiency and dominated sets of assignments," Journal of Economic Theory, Elsevier, vol. 112(1), pages 157-172, September.
- Alcalde, Jose & Silva-Reus, José Ángel, 2013. "Allocating via Priorities," QM&ET Working Papers 13-3, Universidad de Alicante, Departamento de Métodos Cuantitativos y Teoría Económica.
- Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Østerdal, Lars Peter, 2012.
"Assigning agents to a line,"
Discussion Papers of Business and Economics
11/2012, Department of Business and Economics, University of Southern Denmark.
- HOUGAARD, Jens L. & moreno-ternero, JUAN D. & OSTERDAL, Lars P., 2013. "Assigning agents to a line," CORE Discussion Papers 2013015, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Jens L. Hougaard & Juan D. Moreno-Ternero & Lars P. Osterdal, 2014. "Assigning agents to a line," Working Papers 14.01, Universidad Pablo de Olavide, Department of Economics.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Martin J. Osborne).
If references are entirely missing, you can add them using this form.