1,636
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

Cutting a Cake Fairly for Groups Revisited

&
Pages 203-213 | Received 11 Oct 2021, Accepted 03 Jan 2022, Published online: 13 Jan 2023

References

  • Avvakumov, S., Karasev, R. (2021). Envy-free division using mapping degree. Mathematika. 67(1): 36–53. DOI: 10.1112/mtk.12059.
  • Bogomolnaia, A., Moulin, H., Sandomirskiy, F., Yanovskaya, E. (2017). Competitive division of a mixed manna. Econometrica. 85(6): 1847–1871.
  • Brams, S. J., Taylor, A. D. (1996). Fair Division: From Cake-Cutting to Dispute Resolution. Cambridge, UK: Cambridge Univ. Press.
  • Meunier, F., Zerbib, S. (2019). Envy-free cake division without assuming the players prefer nonempty pieces. Israel J. Math. 234(2): 907–925.
  • Nyman, K., Su, F. E., and Zerbib, S. (2020). Fair division with multiple pieces. Discrete Appl. Math. 283: 115–122. DOI: 10.1016/j.dam.2019.12.018.
  • Procaccia, A. D. (2013). Cake cutting: Not just child’s play. Commun. ACM. 56(7): 78–87. DOI: 10.1145/2483852.2483870.
  • Procaccia, A. D. (2016). Cake cutting algorithms. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. D., eds. Handbook of Computational Social Choice. Cambridge, UK: Cambridge University Press, pp. 311–329.
  • Robertson, J., Webb, W. (1998). Cake-Cutting Algorithms: Be Fair if You Can. Boca Raton, FL: Peters/CRC Press.
  • Segal-Halevi, E. (2018). Fairly dividing a cake after some parts were burnt in the oven. In: André, E., Koenig, S., Dastani, M., Sukthankar, G., eds. Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, pp. 1276–1284.
  • Segal-Halevi, E., Suksompong W. (2021). How to cut a cake fairly: a generalization to groups. Amer. Math. Monthly. 128(1): 79–83.
  • Simmons, F. W., Su, F. E. (2003). Consensus-halving via theorems of Borsuk-Ulam and Tucker. Math. Soc. Sci. 45(1): 15–25.
  • Stromquist, W. (1980). How to cut a cake fairly. Amer. Math. Monthly. 87(8): 640–644. Addendum at Amer. Math. Monthly. 88(8): 613–614.
  • Stromquist, W. (2008). Envy-free cake divisions cannot be found by finite protocols. Electron. J. Comb. 15: #R11.
  • Su, F. E. (1999). Rental harmony: Sperner’s lemma in fair division. Amer. Math. Monthly. 106(10): 936–942.
  • Woodall, D. R. (1980). Dividing a cake fairly. J. Math. Anal. Appl. 78(1): 233–247.