Communication Complexity of Cake Cutting
Proceedings of the 2019 ACM Conference on Economics and Computation, Volume abs/1709.09876, 2019, Pages 525-525.
We study classic cake-cutting problems, but in discrete models rather than using infinite-precision real values, specifically, focusing on their communication complexity. Using general discrete simulations of classical infinite-precision protocols (Robertson-Webb and moving-knife), we roughly partition the various fair-allocation problems...More
Full Text (Upload PDF)
PPT (Upload PPT)