PPAD-Completeness of Contiguous Envy-Free Cake Cutting with Additive Valuations.

arXiv:2610.19690v1 Announce Type: cross Abstract: We prove that computing a complete contiguous $\varepsilon$-envy-free cake allocation is PPAD-complete for normalized rational piecewise-constant additive valuations. The hardness holds even when $\varepsilon$