IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1911.10009.html
   My bibliography  Save this paper

Guarantees in Fair Division: general or monotone preferences

Author

Listed:
  • Anna bogomolnaia
  • Herve Moulin

Abstract

To divide a "manna" {\Omega} of private items (commodities, workloads, land, time intervals) between n agents, the worst case measure of fairness is the welfare guaranteed to each agent, irrespective of others' preferences. If the manna is non atomic and utilities are continuous (not necessarily monotone or convex), we can guarantee the minMax utility: that of our agent's best share in her worst partition of the manna; and implement it by Kuhn's generalisation of Divide and Choose. The larger Maxmin utility -- of her worst share in her best partition -- cannot be guaranteed, even for two agents. If for all agents more manna is better than less (or less is better than more), our Bid & Choose rules implement guarantees between minMax and Maxmin by letting agents bid for the smallest (or largest) size of a share they find acceptable.

Suggested Citation

  • Anna bogomolnaia & Herve Moulin, 2019. "Guarantees in Fair Division: general or monotone preferences," Papers 1911.10009, arXiv.org, revised Sep 2020.
    • Handle: RePEc:arx:papers:1911.10009
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1911.10009
    File Function: Latest version
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Anna Bogomolnaia & Hervé Moulin & Fedor Sandomirskiy & Elena Yanovskaya, 2017. "Competitive Division of a Mixed Manna," Econometrica, Econometric Society, vol. 85(6), pages 1847-1871, November.
    2. Berliant, Marcus & Thomson, William & Dunz, Karl, 1992. "On the fair division of a heterogeneous commodity," Journal of Mathematical Economics, Elsevier, vol. 21(3), pages 201-216.
    3. Segal-Halevi, Erel & Nitzan, Shmuel & Hassidim, Avinatan & Aumann, Yonatan, 2017. "Fair and square: Cake-cutting in two dimensions," Journal of Mathematical Economics, Elsevier, vol. 70(C), pages 1-28.
    4. Mount, Kenneth & Reiter, Stanley, 1974. "The informational size of message spaces," Journal of Economic Theory, Elsevier, vol. 8(2), pages 161-192, June.
    5. Hervé Moulin, 2019. "Fair Division in the Internet Age," Annual Review of Economics, Annual Reviews, vol. 11(1), pages 407-441, August.
    6. Moulin, Herve, 1992. " All Sorry to Disagree: A General Principle for the Provision of Nonrival Goods," Scandinavian Journal of Economics, Wiley Blackwell, vol. 94(1), pages 37-51.
    7. Barbera, Salvador & Dutta, Bhaskar, 1982. "Implementability via protective equilibria," Journal of Mathematical Economics, Elsevier, vol. 10(1), pages 49-65, June.
    8. Moulin, Herve, 1992. "Welfare bounds in the cooperative production problem," Games and Economic Behavior, Elsevier, vol. 4(3), pages 373-401, July.
    9. Anna Bogomolnaia & Hervé Moulin & Fedor Sandomirskiy & Elena Yanovskaia, 2019. "Dividing bads under additive utilities," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 52(3), pages 395-417, March.
    10. Eric Budish, 2011. "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes," Journal of Political Economy, University of Chicago Press, vol. 119(6), pages 1061-1103.
    11. Agnes Cseh & Tamás Fleiner, 2018. "The complexity of cake cutting with unequal shares," CERS-IE WORKING PAPERS 1819, Institute of Economics, Centre for Economic and Regional Studies.
    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. Anna Bogomolnaia & Herve Moulin, 2022. "Fair Division with Money and Prices," Papers 2202.08117, arXiv.org.

    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. Erel Segal-Halevi & Shmuel Nitzan, 2019. "Fair cake-cutting among families," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 53(4), pages 709-740, December.
    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. Miralles, Antonio & Pycia, Marek, 2021. "Foundations of pseudomarkets: Walrasian equilibria for discrete resources," Journal of Economic Theory, Elsevier, vol. 196(C).
    4. Bogomolnaia, Anna & Holzman, Ron & Moulin, Hervé, 2023. "On guarantees, vetoes and random dictators," Theoretical Economics, Econometric Society, vol. 18(1), January.
    5. Ortega, Josué, 2020. "Multi-unit assignment under dichotomous preferences," Mathematical Social Sciences, Elsevier, vol. 103(C), pages 15-24.
    6. Anna bogomolnaia Ron Holzman Herve Moulin, 2021. "Wost Case in Voting and Bargaining," Papers 2104.02316, arXiv.org.
    7. Dall’Aglio, Marco, 2023. "Fair division of goods in the shadow of market values," European Journal of Operational Research, Elsevier, vol. 307(2), pages 785-801.
    8. Anna Bogomolnaia & Ron Holzman & Hervé Moulin, 2021. "Worst Case in Voting and Bargaining," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-03196999, HAL.
    9. Anna Bogomolnaia & Hervé Moulin & Fedor Sandomirskiy, 2022. "On the Fair Division of a Random Object," Management Science, INFORMS, vol. 68(2), pages 1174-1194, February.
    10. Hao Guo & Weidong Li & Bin Deng, 2023. "A Survey on Fair Allocation of Chores," Mathematics, MDPI, vol. 11(16), pages 1-28, August.
    11. Mithun Chakraborty & Ayumi Igarashi & Warut Suksompong & Yair Zick, 2019. "Weighted Envy-Freeness in Indivisible Item Allocation," Papers 1909.10502, arXiv.org, revised Mar 2021.
    12. Fedor Sandomirskiy & Erel Segal-Halevi, 2019. "Efficient Fair Division with Minimal Sharing," Papers 1908.01669, arXiv.org, revised Apr 2022.
    13. Krist'of B'erczi & Erika R. B'erczi-Kov'acs & Endre Boros & Fekadu Tolessa Gedefa & Naoyuki Kamiyama & Telikepalli Kavitha & Yusuke Kobayashi & Kazuhisa Makino, 2020. "Envy-free Relaxations for Goods, Chores, and Mixed Items," Papers 2006.04428, arXiv.org.
    14. Josué Ortega & Erel Segal-Halevi, 2022. "Obvious manipulations in cake-cutting," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(4), pages 969-988, November.
    15. Watts, Alison, 1999. "Cooperative production: a comparison of lower and upper bounds," Journal of Mathematical Economics, Elsevier, vol. 32(3), pages 317-331, November.
    16. Soroush Ebadian & Dominik Peters & Nisarg Shah, 2022. "How to Fairly Allocate Easy and Difficult Chores," Post-Print hal-03834514, HAL.
    17. Matthew O. Jackson, 2001. "A crash course in implementation theory," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 18(4), pages 655-708.
    18. Hadi Hosseini, 2023. "The Fairness Fair: Bringing Human Perception into Collective Decision-Making," Papers 2312.14402, arXiv.org.
    19. Priyanka Shende & Manish Purohit, 2020. "Strategy-proof and Envy-free Mechanisms for House Allocation," Papers 2010.16384, arXiv.org.
    20. Pasin Manurangsi & Warut Suksompong, 2020. "Closing Gaps in Asymptotic Fair Division," Papers 2004.05563, arXiv.org.

    More about this item

    JEL classification:

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:1911.10009. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.