{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T15:21:09Z","timestamp":1769354469281,"version":"3.49.0"},"reference-count":9,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T00:00:00Z","timestamp":1584662400000},"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":["Commun. ACM"],"published-print":{"date-parts":[[2020,3,20]]},"abstract":"<jats:p>We consider the well-studied cake cutting problem in which the goal is to find an envy-free allocation of a divisible resource based on queries from agents. The problem has received attention in mathematics, economics, and computer science. It has been a major open problem whether there exists a discrete and bounded envy-free protocol. We report on our algorithm that resolved the open problem.<\/jats:p>","DOI":"10.1145\/3382129","type":"journal-article","created":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T15:06:50Z","timestamp":1584716810000},"page":"119-126","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["A bounded and envy-free cake cutting algorithm"],"prefix":"10.1145","volume":"63","author":[{"given":"Haris","family":"Aziz","sequence":"first","affiliation":[{"name":"UNSW Sydney, Australia"}]},{"given":"Simon","family":"Mackenzie","sequence":"additional","affiliation":[{"name":"CSIRO Data61, Sydney, Australia"}]}],"member":"320","published-online":{"date-parts":[[2020,3,20]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897522"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.52"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1995.11990526"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.164"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI) (AAAI Press","author":"Procaccia A.D.","year":"2009"},{"key":"e_1_2_1_7_1","first-page":"56","article-title":"Not just child's play","volume":"7","author":"Procaccia A.D.","year":"2013","journal-title":"Commun. ACM"},{"key":"e_1_2_1_8_1","volume-title":"Peters","author":"Robertson J.M.","year":"1998"},{"key":"e_1_2_1_9_1","first-page":"101","article-title":"The problem of fair division","volume":"16","author":"Steinhaus H","year":"1948","journal-title":"Econometrica"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382129","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3382129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:08Z","timestamp":1750197728000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,20]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,3,20]]}},"alternative-id":["10.1145\/3382129"],"URL":"https:\/\/doi.org\/10.1145\/3382129","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,20]]},"assertion":[{"value":"2020-03-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}