We prove that in a certain cake cutting model, every fair cake division protocol for n players must use O(n log n) cuts in the worst case. Up to a small constant factor, our lower bound matches a corresponding upper bound in the same model by Even & Paz from 1984.
No takes yet. Share an insight, caveat, or question.
Philip M. Boffey (1978) studied this question.