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

A paradoxical Pareto frontier in the cake-cutting context

Author

Listed:
  • Taylor, Alan D.

Abstract

No abstract is available for this item.

Suggested Citation

  • Taylor, Alan D., 2005. "A paradoxical Pareto frontier in the cake-cutting context," Mathematical Social Sciences, Elsevier, vol. 50(2), pages 227-233, September.
    • Handle: RePEc:eee:matsoc:v:50:y:2005:i:2:p:227-233
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165-4896(05)00065-X
    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. Weller, Dietrich, 1985. "Fair division of a measurable space," Journal of Mathematical Economics, Elsevier, vol. 14(1), pages 5-17, February.
    2. Barbanel,Julius B. Introduction by-Name:Taylor,Alan D., 2005. "The Geometry of Efficient Fair Division," Cambridge Books, Cambridge University Press, number 9780521842488, October.
    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. 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.
    2. 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.
    3. Barbanel, Julius B. & Brams, Steven J., 2011. "Two-person cake-cutting: the optimal number of cuts," MPRA Paper 34263, University Library of Munich, Germany.
    4. 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.
    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. Sagara, Nobusumi, 2008. "A characterization of [alpha]-maximin solutions of fair division problems," Mathematical Social Sciences, Elsevier, vol. 55(3), pages 273-280, May.
    7. Radzvilas, Mantas, 2016. "Hypothetical Bargaining and the Equilibrium Selection Problem in Non-Cooperative Games," MPRA Paper 70248, University Library of Munich, Germany.
    8. 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.
    9. Thomson, William, 2005. "Divide-and-permute," Games and Economic Behavior, Elsevier, vol. 52(1), pages 186-200, July.
    10. 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.
    11. Ji-Won Park & Jaeup U. Kim & Cheol-Min Ghim & Chae Un Kim, 2021. "The Boltzmann fair division for distributive justice," Papers 2109.11917, arXiv.org, revised Nov 2021.
    12. 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.
    13. 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.
    14. 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.
    15. Masarani, F. & Gokturk, S. S., 1991. "A problem in discrete distributive justice," Economics Letters, Elsevier, vol. 36(3), pages 253-256, July.
    16. 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.
    17. 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.
    18. Husseinov, Farhad, 2011. "A theory of a heterogeneous divisible commodity exchange economy," Journal of Mathematical Economics, Elsevier, vol. 47(1), pages 54-59, January.
    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. Bhardwaj, Bhavook & Kumar, Rajnish & Ortega, Josué, 2020. "Fairness and efficiency in cake-cutting with single-peaked preferences," Economics Letters, Elsevier, vol. 190(C).

    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:50:y:2005:i:2:p:227-233. 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.