Smallest open case

three agents and 3 or 4 cuts; four agents and 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)