Exact Cut Complexity of Equal-Length Proportional Cake Cutting

Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui

We study proportional cake cutting under an equal-length constraint, where each of $n$ agents must receive a bundle of length exactly $1/n$ that is worth at least $1/n$ to that age…