For n=3, Selfridge–Conway procedure solves the problem in finite time with 5 cuts (and at most 2 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)