1![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 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](https://www.pdfsearch.io/img/3b26e7c919503d661b0e648d89e8ed96.jpg) | Add to Reading ListSource URL: arxiv.org- Date: 2016-12-29 20:12:31
|
---|
2![A Discrete and Bounded Envy-Free Cake Cutting Protocol for Four Agents Haris Aziz Simon Mackenzie A Discrete and Bounded Envy-Free Cake Cutting Protocol for Four Agents Haris Aziz Simon Mackenzie](https://www.pdfsearch.io/img/02911cc1bf7bb0c4686bc345ebc1b95b.jpg) | Add to Reading ListSource URL: arxiv.org- Date: 2016-04-06 21:39:18
|
---|
3![Fellows of the Econometric Society / Jewish surnames / Surname / Economics / Genealogy / Fair division / Tayfun Snmez / Envy-free cake-cutting / Aumann / Alvin E. Roth / Segal / Snmez Fellows of the Econometric Society / Jewish surnames / Surname / Economics / Genealogy / Fair division / Tayfun Snmez / Envy-free cake-cutting / Aumann / Alvin E. Roth / Segal / Snmez](/pdf-icon.png) | Add to Reading ListSource URL: u.cs.biu.ac.ilLanguage: English - Date: 2015-03-18 18:04:34
|
---|
4![EuroCG 2016, Lugano, Switzerland, March 30–April 1, 2016 Fair and Square: Cake-Cutting in Two Dimensions Erel Segal-Halevi Shmuel Nitzan EuroCG 2016, Lugano, Switzerland, March 30–April 1, 2016 Fair and Square: Cake-Cutting in Two Dimensions Erel Segal-Halevi Shmuel Nitzan](https://www.pdfsearch.io/img/74dff7307d503de35099303db7f98fe4.jpg) | Add to Reading ListSource URL: erelsgl.github.ioLanguage: English - Date: 2016-08-17 02:09:47
|
---|
5![Online cake cutting Toby Walsh NICTA and UNSW Sydney, Australia Email: [removed] Abstract. We propose an online form of the cake cutting problem. This models situations where agents arrive and depart durin Online cake cutting Toby Walsh NICTA and UNSW Sydney, Australia Email: [removed] Abstract. We propose an online form of the cake cutting problem. This models situations where agents arrive and depart durin](https://www.pdfsearch.io/img/9cb244e193c709226aa6394728dbed74.jpg) | Add to Reading ListSource URL: www.cse.unsw.edu.auLanguage: English - Date: 2011-06-27 03:05:09
|
---|
6![M PRA Munich Personal RePEc Archive N-Person cake-cutting: there may be no perfect division Steven J. Brams and Michael A. Jones and Christian Klamler M PRA Munich Personal RePEc Archive N-Person cake-cutting: there may be no perfect division Steven J. Brams and Michael A. Jones and Christian Klamler](https://www.pdfsearch.io/img/cfc5708f61c207d1503aacaadac8a190.jpg) | Add to Reading ListSource URL: mpra.ub.uni-muenchen.deLanguage: English - Date: 2013-02-12 20:45:19
|
---|