A recent arXiv paper proves that computing a complete contiguous ε-envy-free cake allocation is PPAD-complete. The result applies to normalized rational piecewise-constant additive valuations, a standard model for representing agents' preferences over intervals of a divisible resource.
The hardness result holds even when the error tolerance ε is given in unary, meaning the problem does not become easier when the allowed envy is specified with high precision. This places the problem in the same complexity class as other well-known equilibrium computation tasks, such as finding Nash equilibria in certain games.
Because the allocation must be contiguous, the result addresses a natural and widely studied version of cake cutting. It indicates that, under standard complexity assumptions, there is no efficient algorithm that guarantees a complete contiguous division with arbitrarily small envy, even for simple piecewise-constant valuations.