PPAD-Completeness of Contiguous Envy-Free Cake Cutting with Additive ValuationsResearch Paper
Dividing land, a time interval, or another ordered resource can require each recipient's share to be connected. Envy-freeness asks that every agent value its own share at least as highly as anyone else's. Requiring connected shares makes the computational question different from unconstrained cake division: both the cuts and the assignment of the resulting…