IDEAS home Printed from https://ideas.repec.org/p/mtl/montde/2001-27.html
   My bibliography  Save this paper

Probabilistic Assignments of Identical Indivisible Objects and Uniform Probabilistic Rules

Author

Listed:
  • EHLERS, Lars
  • KLAUS, Bettina

Abstract

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 no-envy. We also show that in this characterization no-envy cannot be replaced by anonymity. When agents are strictly risk averse von-Neumann-Morgenstern utility maximizers, then we reduce the problem of assigning k identical objects to a problem of allocating the amount k of an infinitely divisible commodity.

Suggested Citation

  • EHLERS, Lars & KLAUS, Bettina, 2001. "Probabilistic Assignments of Identical Indivisible Objects and Uniform Probabilistic Rules," Cahiers de recherche 2001-27, Universite de Montreal, Departement de sciences economiques.
    • Handle: RePEc:mtl:montde:2001-27
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/1866/366
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. 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-519, March.
    4. repec:bla:jpbect:v:3:y:2001:i:2:p:167-84 is not listed on IDEAS
    5. 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.
    6. Abdulkadiroglu, Atila & Sonmez, Tayfun, 2003. "Ordinal efficiency and dominated sets of assignments," Journal of Economic Theory, Elsevier, vol. 112(1), pages 157-172, September.
    7. 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.
    8. Ehlers, Lars, 2000. "Indifference and the uniform rule," Economics Letters, Elsevier, vol. 67(3), pages 303-308, June.
    9. Ching, Stephen, 1992. "A simple characterization of the uniform rule," Economics Letters, Elsevier, vol. 40(1), pages 57-60, September.
    10. 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.
    11. 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.
    12. Lars Ehlers & Bettina Klaus, 2001. "Solidarity and Probabilistic Target Rules," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 3(2), pages 167-184, April.
    13. Moulin, Herve & Stong, Richard, 2001. "Fair Queuing and Other Probabilistic Allocation Methods," Working Papers 2000-09, Rice University, Department of Economics.
    14. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yoichi Kasajima, 2013. "Probabilistic assignment of indivisible goods with single-peaked preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 41(1), pages 203-215, June.
    2. Thomson, William, 2011. "Chapter Twenty-One - Fair Allocation Rules," Handbook of Social Choice and Welfare, in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 2, chapter 21, pages 393-506, Elsevier.
    3. repec:ebl:ecbull:v:4:y:2007:i:8:p:1-10 is not listed on IDEAS
    4. Wataru Kureishi & Hideki Mizukami, 2005. "A Characterization of the Randomized Uniform Rule," Discussion Papers in Economics and Business 05-20, Osaka University, Graduate School of Economics.
    5. Adachi, Tsuyoshi, 2010. "The uniform rule with several commodities: A generalization of Sprumont's characterization," Journal of Mathematical Economics, Elsevier, vol. 46(6), pages 952-964, November.
    6. Toulis, Panos & Parkes, David C., 2015. "Design and analysis of multi-hospital kidney exchange mechanisms using random graphs," Games and Economic Behavior, Elsevier, vol. 91(C), pages 360-382.
    7. , & Ilkilic, Rahmi & , & ,, 2012. "Balancing supply and demand under bilateral constraints," Theoretical Economics, Econometric Society, vol. 7(3), September.
    8. Kentaro Hatsumi & Shigehiro Serizawa, 2009. "Coalitionally strategy-proof rules in allotment economies with homogeneous indivisible goods," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 33(3), pages 423-447, September.
    9. Bochet, Olivier & İlkılıç, Rahmi & Moulin, Hervé, 2013. "Egalitarianism under earmark constraints," Journal of Economic Theory, Elsevier, vol. 148(2), pages 535-562.
    10. Wataru KUREISHI & Hideki MIZUKAMI, 2007. "Equal probability for the best and the assignment of identical indivisible objects," Economics Bulletin, AccessEcon, vol. 4(8), pages 1-10.
    11. Haris Aziz & Yoichi Kasajima, 2017. "Impossibilities for probabilistic assignment," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 255-275, August.
    12. X. Ruiz del Portal, 2012. "Conditions for incentive compatibility in models with multidimensional allocation functions and one-dimensional types," Review of Economic Design, Springer;Society for Economic Design, vol. 16(4), pages 311-321, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Østerdal, Lars Peter, 2014. "Assigning agents to a line," Games and Economic Behavior, Elsevier, vol. 87(C), pages 539-553.
    2. Chambers, Christopher P., 2004. "Consistency in the probabilistic assignment model," Journal of Mathematical Economics, Elsevier, vol. 40(8), pages 953-962, December.
    3. Moulin, Herve, 2002. "Axiomatic cost and surplus sharing," Handbook of Social Choice and Welfare, in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 1, chapter 6, pages 289-357, Elsevier.
    4. Moulin, Herve & Stong, Richard, 2003. "Filling a multicolor urn: an axiomatic analysis," Games and Economic Behavior, Elsevier, vol. 45(1), pages 242-269, October.
    5. Salvador Barberà, 2010. "Strategy-proof social choice," Working Papers 420, Barcelona School of Economics.
    6. Thomson, William, 2011. "Chapter Twenty-One - Fair Allocation Rules," Handbook of Social Choice and Welfare, in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 2, chapter 21, pages 393-506, Elsevier.
    7. Felix Brandt & Patrick Lederer & René Romen, 2024. "Relaxed notions of Condorcet-consistency and efficiency for strategyproof social decision schemes," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 63(1), pages 19-55, August.
    8. 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.
    9. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    10. Kesten, Onur, 2009. "Why do popular mechanisms lack efficiency in random environments?," Journal of Economic Theory, Elsevier, vol. 144(5), pages 2209-2226, September.
    11. Chang, Hee-In & Chun, Youngsub, 2017. "Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 80-92.
    12. Liu, Peng & Zeng, Huaxia, 2019. "Random assignments on preference domains with a tier structure," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 176-194.
    13. Pycia, Marek & Ünver, M. Utku, 2015. "Decomposing random mechanisms," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 21-33.
    14. YIlmaz, Özgür, 2010. "The probabilistic serial mechanism with private endowments," Games and Economic Behavior, Elsevier, vol. 69(2), pages 475-491, July.
    15. Moulin, Herve, 2005. "Split-Proof Probabilistic Scheduling," Working Papers 2004-06, Rice University, Department of Economics.
    16. Onur Kesten & Morimitsu Kurino & Alexander S. Nesterov, 2017. "Efficient lottery design," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 31-57, January.
    17. Kojima, Fuhito & Manea, Mihai, 2010. "Incentives in the probabilistic serial mechanism," Journal of Economic Theory, Elsevier, vol. 145(1), pages 106-123, January.
    18. Alexander Nesterov, "undated". "Fairness and Efficiency in a Random Assignment: Three Impossibility Results," BDPEMS Working Papers 2014006, Berlin School of Economics.
    19. Atila Abdulkadiroglu & Tayfun Sönmez, 2003. "School Choice: A Mechanism Design Approach," American Economic Review, American Economic Association, vol. 93(3), pages 729-747, June.
    20. Kesten, Onur, 2006. "More on the uniform rule: Characterizations without Pareto optimality," Mathematical Social Sciences, Elsevier, vol. 51(2), pages 192-200, March.

    More about this item

    Keywords

    obabilistic rules; single-aked eferences; strategy-oofness; uniform allocations;
    All these keywords.

    JEL classification:

    • D61 - Microeconomics - - Welfare Economics - - - Allocative Efficiency; Cost-Benefit Analysis
    • D60 - Microeconomics - - Welfare Economics - - - General
    • C10 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods and Methodology: General - - - General

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:mtl:montde:2001-27. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sharon BREWER (email available below). General contact details of provider: https://edirc.repec.org/data/demtlca.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.