For n\geq 4, the Aziz-Mackenzie procedure solves the problem in finite time, but with many cuts (and many pieces per agent).

Open the “Query complexity of envy-free cake-cutting” section on Wikipedia →

Source: List of unsolved problems in fair division (CC BY-SA 4.0)