IDEAS home Printed from https://ideas.repec.org/a/spr/sochwe/v19y2002i2p325-348.html
   My bibliography  Save this article

Probabilistic allocation rules and single-dipped preferences

Author

Listed:
  • Lars Ehlers

    (Department of Quantitative Economics, Maastricht University, P.O. Box 616, 6200 MD Maastricht, The Netherlands and Département de Sciences Économiques and C.R.D.E., Université de Montréal, Québec H3C 3J7, Canada)

Abstract

We consider the problem of allocating an infinitely divisible endowment among a group of agents with single-dipped preferences. A probabilistic allocation rule assigns a probability distribution over the set of possible allocations to every preference profile. We discuss characterizations of the classes of Pareto-optimal and strategy-proof probabilistic rules which satisfy in addition replacement-domination or no-envy. Interestingly, these results also apply to problems of allocating finitely many identical indivisible objects - to probabilistic and to deterministic allocation.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:sochwe:v:19:y:2002:i:2:p:325-348
    Note: Received: 23 November 1998/Accepted: 20 October 2000
    as

    Download full text from publisher

    File URL: http://link.springer.de/link/service/journals/00355/papers/2019002/20190325.pdf
    Download Restriction: Access to the full text of the articles in this series is restricted
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Bossert, Walter & Peters, Hans, 2014. "Single-basined choice," Journal of Mathematical Economics, Elsevier, vol. 52(C), pages 162-168.
    2. Lars Ehlers & Bettina Klaus, 2003. "Probabilistic assignments of identical indivisible objects and uniform probabilistic rules," Review of Economic Design, Springer;Society for Economic Design, vol. 8(3), pages 249-268, October.
    3. Fumiya Inoue & Hirofumi Yamamura, 2023. "Binary mechanism for the allocation problem with single-dipped preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 60(4), pages 647-669, May.
    4. 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.
    5. Yamamura, Hirofumi, 2023. "Uniform rules for the allocation problem with single-dipped preferences when free-disposal is possible," Economics Letters, Elsevier, vol. 230(C).
    6. Dietzenbacher, Bas & Tamura, Yuki, 2023. "Stable and efficient reallocations when preferences are single-dipped," Economics Letters, Elsevier, vol. 231(C).
    7. Laurence Kranich, 2019. "Divide-and-choose with nonmonotonic preferences," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 7(2), pages 271-276, December.
    8. Murat Öztürk & Hans Peters & Ton Storcken, 2014. "On the location of public bads: strategy-proofness under two-dimensional single-dipped preferences," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 56(1), pages 83-108, May.
    9. Basteck, Christian & Ehlers, Lars H., 2023. "On the constrained efficiency of strategy-proof random assignment," Discussion Papers, Research Unit: Market Behavior SP II 2023-202, WZB Berlin Social Science Center.
    10. Doudou Gong & Bas Dietzenbacher & Hans Peters, 2024. "Mechanisms and axiomatics for division problems with single-dipped preferences," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 78(3), pages 789-813, November.
    11. Dietzenbacher, Bas & Tamura, Yuki, 2023. "Fair and efficient allocations when preferences are single-dipped," Research Memorandum 009, Maastricht University, Graduate School of Business and Economics (GSBE).
    12. Ahmed Doghmi, 2013. "Nash Implementation in an Allocation Problem with Single-Dipped Preferences," Games, MDPI, vol. 4(1), pages 1-12, January.
    13. Toyotaka Sakai, 2012. "Fair waste pricing: an axiomatic analysis to the NIMBY problem," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 50(2), pages 499-521, June.

    More about this item

    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:spr:sochwe:v:19:y:2002:i:2:p:325-348. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.