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

Haris Aziz, Simon Mackenzie. A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents. In Irit Dinur, editor, IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA. pages 416-427, IEEE, 2016. [doi]

Abstract

Abstract is missing.