IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v87y2017icp92-93.html
   My bibliography  Save this article

Existence of a simple and equitable fair division: A short proof

Author

Listed:
  • Chèze, Guillaume

Abstract

In this note we study how to share a good between n players in a simple and equitable way. We give a short proof for the existence of such fair divisions.

Suggested Citation

  • Chèze, Guillaume, 2017. "Existence of a simple and equitable fair division: A short proof," Mathematical Social Sciences, Elsevier, vol. 87(C), pages 92-93.
    • Handle: RePEc:eee:matsoc:v:87:y:2017:i:c:p:92-93
    DOI: 10.1016/j.mathsocsci.2017.03.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S016548961730063X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2017.03.006?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    References listed on IDEAS

    as
    1. Barbanel,Julius B. Introduction by-Name:Taylor,Alan D., 2005. "The Geometry of Efficient Fair Division," Cambridge Books, Cambridge University Press, number 9780521842488, June.
    2. Simmons, Forest W. & Su, Francis Edward, 2003. "Consensus-halving via theorems of Borsuk-Ulam and Tucker," Mathematical Social Sciences, Elsevier, vol. 45(1), pages 15-25, February.
    Full references (including those not matched with items on IDEAS)

    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. Barbanel, Julius B. & Brams, Steven J. & Stromquist, Walter, 2008. "Cutting a pie is not a piece of cake," MPRA Paper 12772, University Library of Munich, Germany.
    2. Marco LiCalzi & Antonio Nicolò, 2009. "Efficient egalitarian equivalent allocations over a single good," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 40(1), pages 27-45, July.
    3. William Thomson, 2007. "Children Crying at Birthday Parties. Why?," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 31(3), pages 501-521, June.
    4. Barbanel, Julius B. & Brams, Steven J., 2011. "Two-person cake-cutting: the optimal number of cuts," MPRA Paper 34263, University Library of Munich, Germany.
    5. Park, Ji-Won & Kim, Chae Un & Isard, Walter, 2012. "Permit allocation in emissions trading using the Boltzmann distribution," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(20), pages 4883-4890.
    6. Farhad Hüsseinov & Nobusumi Sagara, 2013. "Existence of efficient envy-free allocations of a heterogeneous divisible commodity with nonadditive utilities," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 41(4), pages 923-940, October.
    7. Maurice Salles, 2014. "‘Social choice and welfare’ at 30: its role in the development of social choice theory and welfare economics," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(1), pages 1-16, January.
    8. Ji-Won Park & Chae Un Kim & Walter Isard, 2011. "Permit Allocation in Emissions Trading using the Boltzmann Distribution," Papers 1108.2305, arXiv.org, revised Mar 2012.
    9. Steven Brams & Michael Jones & Christian Klamler, 2008. "Proportional pie-cutting," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 353-367, March.
    10. Balazs Sziklai & Erel Segal-Halevi, 2015. "Resource-monotonicity and Population-monotonicity in Cake-cutting," CERS-IE WORKING PAPERS 1552, Institute of Economics, Centre for Economic and Regional Studies.
    11. Brams, Steven & Landweber, Peter, 2018. "3 Persons, 2 Cuts: A Maximin Envy-Free and a Maximally Equitable Cake-Cutting Algorithm," MPRA Paper 84683, University Library of Munich, Germany.
    12. Brams, Steven J. & Jones, Michael A. & Klamler, Christian, 2011. "N-Person cake-cutting: there may be no perfect division," MPRA Paper 34264, University Library of Munich, Germany.
    13. Cloutier, John & Nyman, Kathryn L. & Su, Francis Edward, 2010. "Two-player envy-free multi-cake division," Mathematical Social Sciences, Elsevier, vol. 59(1), pages 26-37, January.
    14. Xiaotie Deng & Qi Qi & Amin Saberi, 2012. "Algorithmic Solutions for Envy-Free Cake Cutting," Operations Research, INFORMS, vol. 60(6), pages 1461-1476, December.
    15. Frédéric Meunier, 2008. "Discrete Splittings of the Necklace," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 678-688, August.
    16. 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.
    17. Xiaotie Deng & Qi Qi & Amin Saberi & Jie Zhang, 2011. "Discrete Fixed Points: Models, Complexities, and Applications," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 636-652, November.
    18. Edith Cohen & Michal Feldman & Amos Fiat & Haim Kaplan & Svetlana Olonetsky, 2010. "Envy-Free Makespan Approximation," Discussion Paper Series dp539, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    19. Brams, Steven J. & Jones, Michael A. & Klamler, Christian, 2010. "Divide-and-conquer: A proportional, minimal-envy cake-cutting algorithm," MPRA Paper 22704, University Library of Munich, Germany.
    20. Marco Dall’Aglio & Camilla Luca, 2014. "Finding maxmin allocations in cooperative and competitive fair division," Annals of Operations Research, Springer, vol. 223(1), pages 121-136, December.

    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:eee:matsoc:v:87:y:2017:i:c:p:92-93. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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.