{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T18:38:29Z","timestamp":1773254309191,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,19]],"date-time":"2016-06-19T00:00:00Z","timestamp":1466294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,19]]},"DOI":"10.1145\/2897518.2897522","type":"proceedings-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T13:04:07Z","timestamp":1465563847000},"page":"454-464","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["A discrete and bounded envy-free cake cutting protocol for four agents"],"prefix":"10.1145","author":[{"given":"Haris","family":"Aziz","sequence":"first","affiliation":[{"name":"Data61, Australia \/ UNSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Mackenzie","sequence":"additional","affiliation":[{"name":"Data61, Australia \/ UNSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13129-0_1"},{"issue":"7","key":"e_1_3_2_1_2_1","first-page":"2061","article-title":"Preference relations and measures in the context of fair division","volume":"123","author":"Barbanel B.","year":"1995","unstructured":"B. Barbanel and A. D. Taylor . Preference relations and measures in the context of fair division . American Mathematical Monthly , 123 ( 7 ): 2061 \u2013 2070 , 1995 . B. Barbanel and A. D. Taylor. Preference relations and measures in the context of fair division. American Mathematical Monthly, 123(7):2061\u20132070, 1995.","journal-title":"American Mathematical Monthly"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546679"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.mathsocsci.2004.03.006"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1995.11990526"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-97-03614-9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.07.005"},{"key":"e_1_3_2_1_9_1","first-page":"488","volume-title":"Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI)","author":"Branzei S.","unstructured":"S. Branzei and P. B. Miltersen . A dictatorship theorem for cake cutting . In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI) , pages 482\u2013 488 . AAAI Press, 2015. S. Branzei and P. B. Miltersen. A dictatorship theorem for cake cutting. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI), pages 482\u2013488. AAAI Press, 2015."},{"key":"e_1_3_2_1_10_1","first-page":"85","article-title":"Hardness results for cake cutting","volume":"86","author":"Busch C.","year":"2005","unstructured":"C. Busch , M. S. Krishnamoorthy , and M. Magdon-Ismail . Hardness results for cake cutting . Bulletin of the EATCS , 86 : 85 \u2013 106 , 2005 . C. Busch, M. S. Krishnamoorthy, and M. Magdon-Ismail. Hardness results for cake cutting. Bulletin of the EATCS, 86:85\u2013106, 2005.","journal-title":"Bulletin of the EATCS"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2012.10.009"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746589"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2448473.2448478"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109588"},{"key":"e_1_3_2_1_15_1","volume-title":"Puzzle-math","author":"Gamow G.","year":"1958","unstructured":"G. Gamow and M. Stern . Puzzle-math . Macmillan , 1958 . G. Gamow and M. Stern. Puzzle-math. Macmillan, 1958."},{"key":"e_1_3_2_1_16_1","volume-title":"COMAP","author":"Garfunkel S.","year":"1988","unstructured":"S. Garfunkel . For all practical purposes social choice . COMAP , 1988 . S. Garfunkel. For all practical purposes social choice. COMAP, 1988."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45156-4"},{"key":"e_1_3_2_1_18_1","article-title":"Dividing the spoils","author":"Hively W.","year":"1995","unstructured":"W. Hively . Dividing the spoils . Discover Magazine , March , 1995 . W. Hively. Dividing the spoils. Discover Magazine, March, 1995.","journal-title":"Discover Magazine"},{"key":"e_1_3_2_1_19_1","first-page":"561","volume-title":"Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI)","author":"Kurokawa D.","unstructured":"D. Kurokawa , J. Lai , and A. D. Procaccia . How to cut a cake before the party ends . In Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI) , pages 555\u2013 561 . AAAI Press, 2013. D. Kurokawa, J. Lai, and A. D. Procaccia. How to cut a cake before the party ends. In Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI), pages 555\u2013561. AAAI Press, 2013."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1204457"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_15"},{"key":"e_1_3_2_1_22_1","volume-title":"Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division","author":"Lindner C.","year":"2015","unstructured":"C. Lindner and J. Rothe . Cake-cutting: Fair division of divisible goods . In J. Rothe, editor, Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division , chapter 7. Springer-Verlag , 2015 . C. Lindner and J. Rothe. Cake-cutting: Fair division of divisible goods. In J. Rothe, editor, Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, chapter 7. Springer-Verlag, 2015."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35311-6_13"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.2000.12005263"},{"key":"e_1_3_2_1_25_1","first-page":"244","volume-title":"Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI)","author":"Procaccia A. D.","unstructured":"A. D. Procaccia . Thou shalt covet thy neighbor\u2019s cake . In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI) , pages 239\u2013 244 . AAAI Press, 2009. A. D. Procaccia. Thou shalt covet thy neighbor\u2019s cake. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), pages 239\u2013244. AAAI Press, 2009."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2483852.2483870"},{"key":"e_1_3_2_1_27_1","volume-title":"Handbook of Computational Social Choice","author":"Procaccia A. D.","year":"2016","unstructured":"A. D. Procaccia . Cake cutting algorithms. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. D. Procaccia, editors, Handbook of Computational Social Choice , chapter 13. Cambridge University Press , 2016 . A. D. Procaccia. Cake cutting algorithms. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. D. Procaccia, editors, Handbook of Computational Social Choice, chapter 13. Cambridge University Press, 2016."},{"key":"e_1_3_2_1_28_1","first-page":"97","article-title":"Near exact and envyfree cake division","volume":"45","author":"Robertson J. M.","year":"1997","unstructured":"J. M. Robertson and W. Webb . Near exact and envyfree cake division . Ars Combinatorica , 45 : 97 \u2013 108 , 1997 . J. M. Robertson and W. Webb. Near exact and envyfree cake division. Ars Combinatorica, 45:97\u2013108, 1997.","journal-title":"Ars Combinatorica"},{"key":"e_1_3_2_1_29_1","volume-title":"Peters","author":"Robertson J. M.","year":"1998","unstructured":"J. M. Robertson and W. A. Webb . Cake Cutting Algorithms: Be Fair If You Can. A. K . Peters , 1998 . J. M. Robertson and W. A. Webb. Cake Cutting Algorithms: Be Fair If You Can. A. K. Peters, 1998."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02158-9_25"},{"key":"e_1_3_2_1_31_1","first-page":"908","volume-title":"Proceedings of the 14th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS)","author":"Segal-Halevi E.","unstructured":"E. Segal-Halevi , A. Hassidim , and Y. Aumann . Waste makes haste: Bounded time protocols for envy-free cake cutting with free disposal . In Proceedings of the 14th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS) , pages 901\u2013 908 . IFAAMAS, 2015. E. Segal-Halevi, A. Hassidim, and Y. Aumann. Waste makes haste: Bounded time protocols for envy-free cake cutting with free disposal. In Proceedings of the 14th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pages 901\u2013908. IFAAMAS, 2015."},{"key":"e_1_3_2_1_32_1","first-page":"101","article-title":"The problem of fair division","volume":"16","author":"Steinhaus H.","year":"1948","unstructured":"H. Steinhaus . The problem of fair division . Econometrica , 16 : 101 \u2013 104 , 1948 . H. Steinhaus. The problem of fair division. Econometrica, 16:101\u2013104, 1948.","journal-title":"Econometrica"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0199-110"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.37236\/735"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.2307\/2589747"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00199-006-0109-3"}],"event":{"name":"STOC '16: Symposium on Theory of Computing","location":"Cambridge MA USA","acronym":"STOC '16","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897522","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897518.2897522","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:39:02Z","timestamp":1750221542000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897522"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,19]]},"references-count":36,"alternative-id":["10.1145\/2897518.2897522","10.1145\/2897518"],"URL":"https:\/\/doi.org\/10.1145\/2897518.2897522","relation":{},"subject":[],"published":{"date-parts":[[2016,6,19]]},"assertion":[{"value":"2016-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}