Advertisement

The Complexity of Cake Cutting with Unequal Shares

  • Ágnes CsehEmail author
  • Tamás Fleiner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11059)

Abstract

An unceasing problem of our prevailing society is the fair division of goods. The problem of proportional cake cutting focuses on dividing a heterogeneous and divisible resource, the cake, among n players who value pieces according to their own measure function. The goal is to assign each player a not necessarily connected part of the cake that the player evaluates at least as much as her proportional share.

In this paper, we investigate the problem of proportional division with unequal shares, where each player is entitled to receive a predetermined portion of the cake. Our main contribution is threefold. First we present a protocol for integer demands that delivers a proportional solution in fewer queries than all known algorithms. Then we show that our protocol is asymptotically the fastest possible by giving a matching lower bound. Finally, we turn to irrational demands and solve the proportional cake cutting problem by reducing it to the same problem with integer demands only. All results remain valid in a highly general cake cutting model, which can be of independent interest.

Notes

Acknowledgment

We thank Simina Brânzei and Erel Segal-Halevi for their generous and insightful advice.

References

  1. 1.
    Barbanel, J.B.: Game-theoretic algorithms for fair and strongly fair cake division with entitlements. Colloq. Math. 69, 59–73 (1996)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Barbanel, J.B., Brams, S.J., Stromquist, W.: Cutting a pie is not a piece of cake. Am. Math. Mon. 116(6), 496–514 (2009)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Beck, A.: Constructing a fair border. Am. Math. Mon. 94(2), 157–162 (1987)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Berliant, M., Thomson, W., Dunz, K.: On the fair division of a heterogeneous commodity. J. Math. Econ. 21(3), 201–216 (1992)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Brams, S.J., Jones, M.A., Klamler, C.: Proportional pie-cutting. Int. J. Game Theory 36(3), 353–367 (2008)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Brams, S.J., Jones, M.A., Klamler, C.: Divide-and-conquer: a proportional, minimal-envy cake-cutting algorithm. SIAM Rev. 53(2), 291–307 (2011)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Carney, E.: A new algorithm for the cake-cutting problem of unequal shares for rational ratios: the divisor reduction method. Sci. Terrapin 3(2), 15–22 (2012)Google Scholar
  8. 8.
    Cohler, Y.J., Lai, J.K., Parkes, D.C., Procaccia, A.D.: Optimal envy-free cake cutting. In: 25th AAAI Conference on Artificial Intelligence (2011)Google Scholar
  9. 9.
    Cseh, Á., Fleiner, T.: The complexity of cake cutting with unequal shares. CoRR abs/1709.03152 (2018). http://arxiv.org/abs/1709.03152
  10. 10.
    Dall’Aglio, M.: The Dubins-Spanier optimization problem in fair division theory. J. Comput. Appl. Math. 130(1), 17–40 (2001)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Dubins, L.E., Spanier, E.H.: How to cut a cake fairly. Am. Math. Mon. 68(1), 1–17 (1961)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Edmonds, J., Pruhs, K.: Cake cutting really is not a piece of cake. ACM Trans. Algorithms (TALG) 7(4), 51 (2011)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Even, S., Paz, A.: A note on cake cutting. Discrete Appl. Math. 7(3), 285–296 (1984)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Hill, T.P.: Determining a fair border. Am. Math. Mon. 90(7), 438–442 (1983)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Iyer, K., Huhns, M.N.: A procedure for the allocation of two-dimensional resources in a multiagent system. Int. J. Coop. Inf. Syst. 18(03n04), 381–422 (2009)CrossRefGoogle Scholar
  16. 16.
    Magdon-Ismail, M., Busch, C., Krishnamoorthy, M.S.: Cake-cutting is not a piece of cake. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 596–607. Springer, Heidelberg (2003).  https://doi.org/10.1007/3-540-36494-3_52CrossRefGoogle Scholar
  17. 17.
    McAvaney, K., Robertson, J., Webb, W.: Ramsey partitions of integers and pair divisions. Combinatorica 12(2), 193–201 (1992)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Robertson, J., Webb, W.: Cake-Cutting Algorithms: Be Fair If You Can. AK Peters, Natick (1998)zbMATHGoogle Scholar
  19. 19.
    Segal-Halevi, E., Nitzan, S., Hassidim, A., Aumann, Y.: Fair and square: cake-cutting in two dimensions. J. Math. Econ. 70, 1–28 (2017)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Shishido, H., Zeng, D.Z.: Mark-choose-cut algorithms for fair and strongly fair division. Group Decis. Negot. 8(2), 125–137 (1999)CrossRefGoogle Scholar
  21. 21.
    Steinhaus, H.: The problem of fair division. Econometrica 16, 101–104 (1948)Google Scholar
  22. 22.
    Woeginger, G.J., Sgall, J.: On the complexity of cake cutting. Discrete Optim. 4(2), 213–220 (2007)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Institute of Economics, Hungarian Academy of SciencesBudapestHungary
  2. 2.Department of Computer Science and Information TheoryBudapest University of Technology and EconomicsBudapestHungary

Personalised recommendations