Time: 1:00pm Tuesday, 3rd May 2016.
Location: SIT 459
Speaker: Simon Mackenzie, Data61
Title: A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents
We consider the well-studied cake cutting problem in which the goal is to find an envy-free allocation based on queries from the agents. The problem has received attention in computer science, mathematics, and economics. It has been a major open problem whether there exists a bounded and discrete envy-free protocol. We resolve the problem by proposing a discrete and bounded envy-free protocol for any number of agents.