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

Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond

Author

Listed:
  • Barbanel, Julius B.
  • Brams, Steven J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Barbanel, Julius B. & Brams, Steven J., 2004. "Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond," Mathematical Social Sciences, Elsevier, vol. 48(3), pages 251-269, November.
    • Handle: RePEc:eee:matsoc:v:48:y:2004:i:3:p:251-269
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165-4896(04)00050-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Harunor Shishido & Dao-Zhi Zeng, 1999. "Mark-Choose-Cut Algorithms For Fair And Strongly Fair Division," Group Decision and Negotiation, Springer, vol. 8(2), pages 125-137, March.
    2. Steven J. Brams & D. Marc Kilgour, 2001. "Competitive Fair Division," Journal of Political Economy, University of Chicago Press, vol. 109(2), pages 418-443, April.
    3. Ichiishi, Tatsuro & Idzik, Adam, 1999. "Equitable allocation of divisible goods," Journal of Mathematical Economics, Elsevier, vol. 32(4), pages 389-400, December.
    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. Nicolò, Antonio & Yu, Yan, 2008. "Strategic divide and choose," Games and Economic Behavior, Elsevier, vol. 64(1), pages 268-289, September.
    2. Barbanel, Julius B. & Brams, Steven J., 2011. "Two-person cake-cutting: the optimal number of cuts," MPRA Paper 34263, University Library of Munich, Germany.
    3. 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.
    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. 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.
    6. Erel Segal-Halevi & Shmuel Nitzan & Avinatan Hassidim & Yonatan Aumann, 2020. "Envy-Free Division of Land," Mathematics of Operations Research, INFORMS, vol. 45(3), pages 896-922, August.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. Fedor Sandomirskiy & Erel Segal-Halevi, 2019. "Efficient Fair Division with Minimal Sharing," Papers 1908.01669, arXiv.org, revised Apr 2022.
    12. Erel Segal-Halevi & Shmuel Nitzan, 2014. "Cake Cutting – Fair and Square," Working Papers 2014-01, Bar-Ilan University, Department of Economics.
    13. 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.
    14. Vittorio Bilò & Ioannis Caragiannis & Michele Flammini & Ayumi Igarashi & Gianpiero Monaco & Dominik Peters & Cosimo Vinci & William Zwicker, 2021. "Almost Envy-Free Allocations with Connected Bundles," Post-Print hal-03834506, HAL.
    15. 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.
    16. 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.
    17. Bilò, Vittorio & Caragiannis, Ioannis & Flammini, Michele & Igarashi, Ayumi & Monaco, Gianpiero & Peters, Dominik & Vinci, Cosimo & Zwicker, William S., 2022. "Almost envy-free allocations with connected bundles," Games and Economic Behavior, Elsevier, vol. 131(C), pages 197-221.
    18. Barbanel, Julius B. & Brams, Steven J., 2010. "Two-person pie-cutting: The fairest cuts," MPRA Paper 22703, University Library of Munich, Germany.
    19. Vittorio Bil`o & Ioannis Caragiannis & Michele Flammini & Ayumi Igarashi & Gianpiero Monaco & Dominik Peters & Cosimo Vinci & William S. Zwicker, 2018. "Almost Envy-Free Allocations with Connected Bundles," Papers 1808.09406, arXiv.org, revised May 2022.

    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. 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.
    2. Nolan Miller & Alexander Wagner & Richard Zeckhauser, 2013. "Solomonic separation: Risk decisions as productivity indicators," Journal of Risk and Uncertainty, Springer, vol. 46(3), pages 265-297, June.
    3. Steven Brams & D. Kilgour & Christian Klamler, 2012. "The undercut procedure: an algorithm for the envy-free division of indivisible items," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(2), pages 615-631, July.
    4. Ortega, Josué, 2020. "Multi-unit assignment under dichotomous preferences," Mathematical Social Sciences, Elsevier, vol. 103(C), pages 15-24.
    5. Azrieli, Yaron & Shmaya, Eran, 2014. "Rental harmony with roommates," Journal of Economic Theory, Elsevier, vol. 153(C), pages 128-137.
    6. Steven J. Brams & Todd R. Kaplan & D. Marc Kilgour, 2015. "A Simple Bargaining Mechanism that Elicits Truthful Reservation Prices," Group Decision and Negotiation, Springer, vol. 24(3), pages 401-413, May.
    7. Francisco Sánchez Sánchez, 2022. "Envy-Free Solutions to the Problem of Room Assignment and Rent Division," Group Decision and Negotiation, Springer, vol. 31(3), pages 703-721, June.
    8. Chakravarty, Surajeet & Kaplan, Todd R., 2013. "Optimal allocation without transfer payments," Games and Economic Behavior, Elsevier, vol. 77(1), pages 1-20.
    9. Barbanel, J. B. & Brams, S. J., 2001. "Cake Division with Minimal Cuts: Envy-Free Procedures for 3 Person, 4 Persons, and Beyond," Working Papers 01-07, C.V. Starr Center for Applied Economics, New York University.
    10. Haake, Claus-Jochen, 2016. "Dividing by Demanding: Object Division through Market Procedures," Center for Mathematical Economics Working Papers 359, Center for Mathematical Economics, Bielefeld University.
    11. Andreas Wagener, 2006. "Geometric division with a fixed point: Not half the cake, but at least 4/9," Group Decision and Negotiation, Springer, vol. 15(1), pages 43-53, January.
    12. Haake, Claus-Jochen & Raith, Matthias G. & Su, Francis Edward, 2017. "Bidding for envy freeness," Center for Mathematical Economics Working Papers 311, Center for Mathematical Economics, Bielefeld University.
    13. Nicolò, Antonio & Velez, Rodrigo A., 2017. "Divide and compromise," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 100-110.
    14. Dall'Aglio, Marco & Maccheroni, Fabio, 2009. "Disputed lands," Games and Economic Behavior, Elsevier, vol. 66(1), pages 57-77, May.
    15. 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.
    16. Azacis, Helmuts, 2008. "Double implementation in a market for indivisible goods with a price constraint," Games and Economic Behavior, Elsevier, vol. 62(1), pages 140-154, January.
    17. Erel Segal-Halevi, 2019. "Generalized Rental Harmony," Papers 1912.13249, arXiv.org, revised Feb 2020.
    18. Velez, Rodrigo A., 2011. "Are incentives against economic justice?," Journal of Economic Theory, Elsevier, vol. 146(1), pages 326-345, January.
    19. Fedor Sandomirskiy & Erel Segal-Halevi, 2019. "Efficient Fair Division with Minimal Sharing," Papers 1908.01669, arXiv.org, revised Apr 2022.
    20. Richard F. Potthoff, 2002. "Use of Linear Programming to Find an Envy-Free Solution Closest to the Brams–Kilgour Gap Solution for the Housemates Problem," Group Decision and Negotiation, Springer, vol. 11(5), pages 405-414, September.

    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:48:y:2004:i:3:p:251-269. 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.