Cake-Cutting Is Not a Piece of Cake
Fair cake-cutting is the division of a cake or resource among N users so that each user is content. Users may value a given piece of cake differently, and information about how a user values different parts of the cake can only be obtained by requesting users to “cut” pieces of the cake into specified ratios. One of the most interesting open questions is to determine the minimum number of cuts required to divide the cake fairly. It is known that O(N logN) cuts suffices, however, it is not known whether one can do better.
We show that sorting can be reduced to cake-cutting: any algorithm that performs fair cake-division can sort. For a general class of cake-cutting algorithms, which we call linearly-labeled, we obtain an Ω(N logN) lower bound on their computational complexity. All the known cake-cutting algorithms fit into this general class, which leads us to conjecture that every cake-cutting algorithm is linearly-labeled. If in addition, the number of comparisons per cut is bounded (comparison-bounded algorithms), then we obtain an Ω(N logN) lower bound on the number of cuts. All known algorithms are comparison-bounded.
We also study variations of envy-free cake-division, where each user feels that they have more cake than every other user. We construct utility functions for which any algorithm (including continuous algorithms) requires Ω(N2) cuts to produce such divisions. These are the the first known general lower bounds for envy-free algorithms. Finally, we study another general class of algorithms called phased algorithms, for which we show that even if one is to simply guarantee each user a piece of cake with positive value, then Ω(N logN) cuts are needed in the worst case. Many of the existing cake-cutting algorithms are phased.
KeywordsUtility Function Label Tree Label Algorithm Fair Division Division Scheme
Unable to display preview. Download preview PDF.
- 8.C-J Haake, M. G. Raith, and F. E. Su. Bidding for envy-freeness: A procedural approach to n-player fair-division problems. Social Choice and Welfare, To appear.Google Scholar
- 9.Jerzy Legut and Wilczýnski. Optimal partitioning of a measuarble space. Proceedings of the American Mathematical Society, 104(1):262–264, September 1988.Google Scholar
- 10.Malik Magdon-Ismail, Costas Busch, and Mukkai Krishnamoorthy. Cake-cutting is not a piece of cake. Technical Report 02-12, Rensselaer Polytechnic Institute, Troy, NY 12180, USA, 2002.Google Scholar
- 11.Elisa Peterson and F. E. Su. Four-person envy-free chore division. Mathematics Magazine, April 2002.Google Scholar
- 12.K. Rebman. How to get (at least) a fair share of the cake. in Mathematical Plums (Edited by R. Honsberger), The Mathematical Association of America, pages 22–37, 1979.Google Scholar
- 15.H. Steinhaus. The problem of fair division. Econometrica, 16:101–104, 1948.Google Scholar
- 17.Gerhard J. Woeginger. An approximation scheme for cake division with a linear number of cuts. In European Symposium on Algorithms (ESA), pages 896–901, 2002.Google Scholar