An Improved Envy-Free Cake Cutting Protocol for Four Agents

Georgios Amanatidis, George Christodoulou, John Fearnley +3

We consider the classic cake-cutting problem of producing envy-free allocations, restricted to the case of four agents. The problem asks for a partition of the cake to four agents,…