A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents

Understand

We consider the well-studied cake cutting problem in which the goal is to find an envy-free allocation based on queries from $n$ agents.

• The problem has received attention in computer science, mathematics, and economics.
• It has been a major open problem whether there exists a discrete and bounded envy-free protocol.
• We resolve the problem by proposing a discrete and bounded envy-free protocol for any number of agents.