The probabilistic serial mechanism with private endowments
AbstractA random assignment is ordinally efficient if it is not stochastically dominated with respect to individual preferences over sure objects. When there are no private endowments, the set of ordinally efficient random assignments is characterized by the eating algorithm (Bogomolnaia and Moulin, 2001). When there are private endowments, the main requirement is individual rationality; however, the eating algorithm fails to deliver this property. Our contribution is the natural generalization of the eating algorithm for this general class of problems. The family of this generalized eating algorithm characterizes the set of individually rational and ordinally efficient random assignments. A special solution in this family, the individually rational probabilistic serial (PSIR), also achieves a new fairness axiom, no justified-envy. However, it is not immune to strategic manipulation. We show that individual rationality, no justified-envy and strategy-proofness are incompatible.
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 69 (2010)
Issue (Month): 2 (July)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Random assignment No justified-envy Ordinal efficiency Simultaneous eating algorithm;
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.:
- Lars-Gunnar Svensson, 1999. "Strategy-proof allocation of indivisible goods," Social Choice and Welfare, Springer, vol. 16(4), pages 557-567.
- Tayfun Sönmez & M. Utku Ünver, 2001.
"House Allocation with Existing Tenants: An Equivalence,"
Game Theory and Information
0112002, EconWPA, revised 26 Sep 2002.
- 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.
- 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.
- Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005.
"Pairwise kidney exchange,"
Journal of Economic Theory,
Elsevier, vol. 125(2), pages 151-188, December.
- Alvin E. Roth & Tayfun Sonmez & M. Utku Unver, 2004. "Pairwise Kidney Exchange," Levine's Bibliography 122247000000000350, UCLA Department of Economics.
- Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Pairwise Kidney Exchange," Boston College Working Papers in Economics 620, Boston College Department of Economics.
- Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Pairwise Kidney Exchange," Game Theory and Information 0408001, EconWPA, revised 16 Feb 2005.
- Alvin E. Roth & Tayfun Sonmez & M. Utku Unver, 2004. "Pairwise Kidney Exchange," NBER Working Papers 10698, National Bureau of Economic Research, Inc.
- Roth, Alvin & Ãœnver, M. Utku & SÃ¶nmez, Tayfun, 2004.
2580565, Harvard University Department of Economics.
- Abdulkadiroglu, Atila & Sonmez, Tayfun, 1999. "House Allocation with Existing Tenants," Journal of Economic Theory, Elsevier, vol. 88(2), pages 233-260, October.
- McLennan, Andrew, 2002. "Ordinal Efficiency and the Polyhedral Separating Hyperplane Theorem," Journal of Economic Theory, Elsevier, vol. 105(2), pages 435-449, August.
- Roth, Alvin E. & Postlewaite, Andrew, 1977. "Weak versus strong domination in a market with indivisible goods," Journal of Mathematical Economics, Elsevier, vol. 4(2), pages 131-137, August.
- Atila Abdulkadiroglu & Tayfun Smez, 2003.
"School Choice: A Mechanism Design Approach,"
0203-18, Columbia University, Department of Economics.
- Ma, Jinpeng, 1994. "Strategy-Proofness and the Strict Core in a Market with Indivisibilities," International Journal of Game Theory, Springer, vol. 23(1), pages 75-83.
- Alvin E. Roth & Uriel G. Rothblum, 1999. "Truncation Strategies in Matching Markets--In Search of Advice for Participants," Econometrica, Econometric Society, vol. 67(1), pages 21-44, January.
- Zhou, Lin, 1990. "On a conjecture by gale about one-sided matching problems," Journal of Economic Theory, Elsevier, vol. 52(1), pages 123-135, October.
- 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.
- Abdulkadiroglu, Atila & Sonmez, Tayfun, 2003. "Ordinal efficiency and dominated sets of assignments," Journal of Economic Theory, Elsevier, vol. 112(1), pages 157-172, September.
- Kesten, Onur, 2009. "Why do popular mechanisms lack efficiency in random environments?," Journal of Economic Theory, Elsevier, vol. 144(5), pages 2209-2226, September.
- Roth, Alvin E., 1982. "Incentive compatibility in a market with indivisible goods," Economics Letters, Elsevier, vol. 9(2), pages 127-132.
- Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
- Hylland, Aanund & Zeckhauser, Richard, 1979. "The Efficient Allocation of Individuals to Positions," Journal of Political Economy, University of Chicago Press, vol. 87(2), pages 293-314, April.
- 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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.