A Lower Bound for Equitable Cake Cutting

  title={A Lower Bound for Equitable Cake Cutting},
  author={Ariel D. Procaccia and Junxing Wang},
We are interested in the problem of dividing a cake -- a heterogeneous divisible good -- among n players, in a way that is ε-equitable: every pair of players must have the same value for their own allocated pieces, up to a difference of at most ε. It is known that such allocations can be computed using O(n ln(1/ε)) operations in the standard Robertson-Webb Model. We establish a lower bound of Ω(ln(1/ε)/lnln(1/ε)) on the complexity of this problem, which is almost tight for a constant number of… CONTINUE READING


Publications referenced by this paper.
Showing 1-5 of 5 references

SpliŠing necklaces

  • N. Alon
  • Advances in Mathematics
  • 1987
Highly Influential
8 Excerpts

A Near Equitable 2-Person Cake CuŠing Algorithm

  • K. Cechlárová, E. Pillárová
  • Optimization 61,
  • 2012
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…