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 cuttinAdd to Reading ListSource URL: arxiv.orgDownload Document from Source WebsiteFile Size: 429,16 KBShare Document on Facebook |