A Discrete and Bounded Envy-free Cake Cutting Protocol for Any Number of Agents HARIS AZIZ, Data61, CSIRO and UNSW Australia and SIMON MACKENZIE, Data61, CSIRO and UNSW Australia We consider the well-studied cake cuttin

First Page		Document Content
Date: 2016-12-29 20:12:31		A Discrete and Bounded Envy-free Cake Cutting Protocol for Any Number of Agents HARIS AZIZ, Data61, CSIRO and UNSW Australia and SIMON MACKENZIE, Data61, CSIRO and UNSW Australia We consider the well-studied cake cuttin Add to Reading List Source URL: arxiv.org Download Document from Source Website File Size: 429,16 KB Share Document on Facebook