Establishes an Omega(n log n) randomized query lower bound for proportional cake cutting in the Robertson-Webb model.
Cake cutting really is not a piece of cake
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An $\Omega(n \log n)$ Randomized Lower Bound for Cutting a Cake into Proportionally Fair Pieces
Establishes an Omega(n log n) randomized query lower bound for proportional cake cutting in the Robertson-Webb model.