Abstract
We propose an online form of the cake cutting problem. This models situations where agents arrive and depart during the process of dividing a resource. We show that well known fair division procedures like cut-and-choose and the Dubins-Spanier moving knife procedure can be adapted to apply to such online problems. We propose some fairness properties that online cake cutting procedures can possess like online forms of proportionality and envy-freeness. We also consider the impact of collusion between agents. Finally, we study theoretically and empirically the competitive ratio of these online cake cutting procedures. Based on its resistance to collusion, and its good performance in practice, our results favour the online version of the cut-and-choose procedure over the online version of the moving knife procedure.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brams, S.J., Taylor, A.D.: Fair Division: From cake-cutting to dispute resolution. Cambridge University Press, Cambridge (1996)
Brams, S.J., Jones, M.A., Klamler, C.: Better ways to cut a cake. Notices of the AMS 53(11), 1314–1321 (2006)
Chen, Y., Lai, J.K., Parkes, D.C., Procaccia, A.D.: Truth, justice, and cake cutting. In: Proceedings of the 24th National Conference on AI. Association for Advancement of Artificial Intelligence (2010)
Chevaleyre, Y., Endriss, U., Maudet, N.: Distributed fair allocation of indivisible goods. Working paper, ILLC, University of Amsterdam (2009)
Cloutier, J., Nyman, K.L., Su, F.E.: Two-player envy-free multi-cake division. Mathematical Social Sciences 59(1), 26–37 (2010)
Dubins, L.E., Spanier, E.H.: How to cut a cake fairly. The American Mathematical Monthly 68(5), 1–17 (1961)
Gent, I.P., Grant, S.A., MacIntyre, E., Prosser, P., Shaw, P., Smith, B.M., Walsh, T.: How Not to Do it. Research Report 97.27, School of Computer Studies, University of Leeds, 1997. An earlier and shorter version of this report by the first and last authors appears In: Proceedings of the AAAI 1994 Workshop on Experimental Evaluation of Reasoning and Search Methods and as Research Paper No 714, Dept. of Artificial Intelligence, Edinburgh (1994)
Gent, I.P., MacIntyre, E., Prosser, P., Smith, B.M., Walsh, T.: Random constraint satisfaction: Flaws and structure. Constraints 6(4), 345–372 (2001)
MacIntyre, E., Prosser, P., Smith, B.M., Walsh, T.: Random constraint satisfaction: Theory meets practice. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 325–339. Springer, Heidelberg (1998)
Pini, M., Rossi, F., Venable, B., Walsh, T.: Incompleteness and incomparability in preference aggregation. In: Proceedings of 20th IJCAI. International Joint Conference on Artificial Intelligence (2007)
Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Dealing with incomplete agents’ preferences and an uncertain agenda in group decision making via sequential majority voting. In: Brewka, G., Lang, J. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference (KR 2008), pp. 571–578. AAAI Press, Menlo Park (2008)
Robertson, J., Web, W.: Cake-Cutting Algorithms: Be Fair If You Can. A K Peters/CRC Press (1998)
Thomson, W.: The fair division of a fixed supply among a growing population. Mathematics of Operations Research 8(3), 319–326 (1983)
Walsh, T.: Uncertainty in preference elicitation and aggregation. In: Proceedings of the 22nd National Conference on AI. Association for Advancement of Artificial Intelligence (2007)
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
Walsh, T. (2011). Online Cake Cutting. In: Brafman, R.I., Roberts, F.S., Tsoukiàs, A. (eds) Algorithmic Decision Theory. ADT 2011. Lecture Notes in Computer Science(), vol 6992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24873-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-24873-3_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24872-6
Online ISBN: 978-3-642-24873-3
eBook Packages: Computer ScienceComputer Science (R0)