Abstract
We consider the problem of fairly dividing a heterogeneous cake between a number of players with different tastes. In this setting, it is known that fairness requirements may result in a suboptimal division from the social welfare standpoint. Here, we show that in some cases, discarding some of the cake and fairly dividing only the remainder may be socially preferable to any fair division of the entire cake. We study this phenomenon, providing asymptotically-tight bounds on the social improvement achievable by such discarding.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aumann, Y., Dombb, Y.: The efficiency of fair division with connected pieces. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 26–37. Springer, Heidelberg (2010)
Brams, S.J., Taylor, A.D.: An envy-free cake division protocol. The American Mathematical Monthly 102(1), 9–18 (1995)
Brams, S.J., Taylor, A.D.: Fair Division: From cake cutting to dispute resolution. Cambridge University Press, New York (1996)
Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: The efficiency of fair division. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 475–482. Springer, Heidelberg (2009)
Caragiannis, I., Lai, J., Procaccia, A.: Towards more expressive cake cutting. In: IJCAI: International Joint Conferences on Artificial Intelligence (2011)
Chen, Y., Lai, J., Parkes, D.C., Procaccia, A.D.: Truth, justice, and cake cutting. In: AAAI (2010)
Dubins, L.E., Spanier, E.H.: How to cut a cake fairly. The American Mathematical Monthly 68(1), 1–17 (1961)
Edmonds, J., Pruhs, K.: Cake cutting really is not a piece of cake. In: SODA 2006: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 271–278. ACM, New York (2006)
Even, S., Paz, A.: A note on cake cutting. Discrete Applied Mathematics 7(3), 285–296 (1984)
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)
Moulin, H.J.: Fair Division and Collective Welfare. Number 0262633116 in MIT Press Books. The MIT Press (2004)
Procaccia, A.D.: Thou shalt covet thy neighbor’s cake. In: IJCAI, pp. 239–244 (2009)
Robertson, J., Webb, W.: Cake-cutting algorithms: Be fair if you can. A K Peters, Ltd., Natick (1998)
Sgall, J., Woeginger, G.J.: A lower bound for cake cutting. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 459–469. Springer, Heidelberg (2003)
Steinhaus, H.: Sur la division pragmatique. Econometrica 17(Supplement: Report of the Washington Meeting), 315–319 (1949)
Stromquist, W.: How to cut a cake fairly. The American Mathematical Monthly 87(8), 640–644 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arzi, O., Aumann, Y., Dombb, Y. (2011). Throw One’s Cake — and Eat It Too. In: Persiano, G. (eds) Algorithmic Game Theory. SAGT 2011. Lecture Notes in Computer Science, vol 6982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24829-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-24829-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24828-3
Online ISBN: 978-3-642-24829-0
eBook Packages: Computer ScienceComputer Science (R0)