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

13 Apr 2016Haris AzizSimon Mackenzie

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... (read more)

PDF Abstract