1 paper
Stephen Arndt, Benjamin Moseley, Sungjin Im +1
We design and analyze a deterministic cake cutting algorithm that achieves proportional fairness using a linear number of cuts. The best previous upper bound on the number of cuts…