Cake-Cutting with Different Entitlements: How Many Cuts are Needed?

Abstract A cake has to be divided fairly among n agents. When all agents have equal entitlements, it is known that such a division can be implemented with n − 1 cuts. When agents may have different entitlements, the paper shows that at least 2 n − 2 cuts may be necessary, and O ( n log ⁡ n ) cuts are always sufficient.

[1]  Julius B. Barbanel.  Game-theoretic algorithms for fair and strongly fair cake division with entitlements , 1996 .

[2]  Jörg Rothe,et al.  Cake-Cutting: Fair Division of Divisible Goods , 2016, Economics and Computation.

[3]  Mohammad Taghi Hajiaghayi,et al.  Fair Allocation of Indivisible Goods to Asymmetric Agents , 2017, AAMAS.

[4]  Steven J. Brams,et al.  Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Procedure , 2007, Fair Division.

[5]  Steven J. Brams,et al.  Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm , 2010, SIAM Rev..

[6]  Jack M. Robertson,et al.  Ramsey partitions of integers and fair divisions , 1992, Comb..

[7]  Jack M. Robertson,et al.  Cake-cutting algorithms - be fair if you can , 1998 .

[8]  曽 道智,et al.  Mark-Choose-Cut Algorithms for Fair and Strongly Fair Division , 1996 .

[9]  Steven J. Brams.  Fair Division* , 2009, Encyclopedia of Complexity and Systems Science.

[10]  Lester E. Dubins,et al.  How to Cut a Cake Fairly , 1961 .

[11]  Erel Segal-Halevi,et al.  Competitive Equilibrium For almost All Incomes , 2017, AAMAS.

[12]  Moshe Babaioff,et al.  Competitive Equilibria with Indivisible Goods and Generic Budgets , 2017, Math. Oper. Res..

[13]  Steven J. Brams,et al.  Mathematics and democracy: Designing better voting and fair-division procedures , 2008, Math. Comput. Model..

[14]  Ariel D. Procaccia.  Cake Cutting Algorithms , 2016, Handbook of Computational Social Choice.

[15]  Hervé Moulin,et al.  Fair division and collective welfare , 2003 .

[16]  Erel Segal-Halevi.  Fair Division of an Archipelago , 2018 .

[17]  Steven J. Brams,et al.  Fair division - from cake-cutting to dispute resolution , 1998 .

[18]  Tamás Fleiner,et al.  The Complexity of Cake Cutting with Unequal Shares , 2020, ACM Trans. Algorithms.

[19]  Tamás Fleiner,et al.  The Complexity of Cake Cutting with Unequal Shares , 2017, SAGT.

[20]  W. A. Webb,et al.  Extensions of Cut-and-Choose Fair Division , 1997 .

[21]  Douglas R. Woodall,et al.  Sets on Which Several Measures Agree , 1985 .