Probabilistic Assignements of Identical Indivisible Objects and Uniform Probabilistic Rules
We consider a probabilistic approach to the problem of assigning K indivisible identical objects to a set of agents with single-peaked preferences. Using the ordinal extension of preferences, we characterize the class of uniform probabilistic rules by Pareto efficiency, strategy-proofness, and non-envy.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||2001|
|Date of revision:|
|Contact details of provider:|| Postal: C.P. 6128, Succ. centre-ville, Montréal (PQ) H3C 3J7|
Phone: (514) 343-6557
Fax: (514) 343-7221
Web page: http://www.cireq.umontreal.ca
More information through EDIRC
References listed on IDEAS
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.:
- Hervé Moulin, 2002.
"The proportional random allocation of indivisible units,"
Social Choice and Welfare,
Springer;The Society for Social Choice and Welfare, vol. 19(2), pages 381-413.
- Moulin, Herve, 2000. "The Proportional Random Allocation of Indivisible Units," Working Papers 2000-02, Rice University, Department of Economics.
- Abdulkadiroglu, Atila & Sonmez, Tayfun, 2003. "Ordinal efficiency and dominated sets of assignments," Journal of Economic Theory, Elsevier, vol. 112(1), pages 157-172, September.
- 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.
- Lars Ehlers, 2002. "Probabilistic allocation rules and single-dipped preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 19(2), pages 325-348.
- Ching, Stephen, 1992. "A simple characterization of the uniform rule," Economics Letters, Elsevier, vol. 40(1), pages 57-60, September.
- Sprumont, Yves, 1991. "The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule," Econometrica, Econometric Society, vol. 59(2), pages 509-19, March.
- Ehlers, Lars & Klaus, Bettina, 2001. " Solidarity and Probabilistic Target Rules," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 3(2), pages 167-84.
- Ehlers, Lars & Peters, Hans & Storcken, Ton, 2002. "Strategy-Proof Probabilistic Decision Schemes for One-Dimensional Single-Peaked Preferences," Journal of Economic Theory, Elsevier, vol. 105(2), pages 408-434, August.
- Moulin, Herve, 1994. "Social choice," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 2, chapter 31, pages 1091-1125 Elsevier.
- 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.
- Crès, Hervé & Moulin, Hervé, 1998. "Random Priority: A Probabilistic Resolution of the Tragedy of the Commons," Working Papers 98-06, Duke University, Department of Economics.
- Ehlers, Lars, 2000. "Indifference and the uniform rule," Economics Letters, Elsevier, vol. 67(3), pages 303-308, June.
- Moulin, Herve & Stong, Richard, 2001. "Fair Queuing and Other Probabilistic Allocation Methods," Working Papers 2000-09, Rice University, Department of Economics.
When requesting a correction, please mention this item's handle: RePEc:mtl:montec:2001-27. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sharon BREWER)
If references are entirely missing, you can add them using this form.