{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T06:03:03Z","timestamp":1769752983351,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62102252"],"award-info":[{"award-number":["62102252"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,12]]},"DOI":"10.1145\/3490486.3538321","type":"proceedings-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T13:29:36Z","timestamp":1657718976000},"page":"404-434","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["On Existence of Truthful Fair Cake Cutting Mechanisms"],"prefix":"10.1145","author":[{"given":"Biaoshuai","family":"Tao","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00355-003-0231-0"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10584"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24829-0_8"},{"key":"e_1_3_2_1_4_1","volume-title":"31st International Symposium on Algorithms and Computation (ISAAC","author":"Asano Takao","year":"2020","unstructured":"Takao Asano and Hiroyuki Umeda . 2020 . Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts . In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik. Takao Asano and Hiroyuki Umeda. 2020. Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2781776"},{"key":"e_1_3_2_1_6_1","volume-title":"Computing socially-efficient cake divisions. arXiv preprint arXiv:1205.3982","author":"Aumann Yonatan","year":"2012","unstructured":"Yonatan Aumann , Yair Dombb , and Avinatan Hassidim . 2012. Computing socially-efficient cake divisions. arXiv preprint arXiv:1205.3982 ( 2012 ). Yonatan Aumann, Yair Dombb, and Avinatan Hassidim. 2012. Computing socially-efficient cake divisions. arXiv preprint arXiv:1205.3982 (2012)."},{"key":"e_1_3_2_1_7_1","volume-title":"A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents. FOCS","author":"Aziz Haris","year":"2016","unstructured":"Haris Aziz and Simon Mackenzie . 2016a. A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents. FOCS ( 2016 ). Haris Aziz and Simon Mackenzie. 2016a. A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents. FOCS (2016)."},{"key":"e_1_3_2_1_8_1","volume-title":"A discrete and bounded envy-free cake cutting protocol for four agents. STOC","author":"Aziz Haris","year":"2016","unstructured":"Haris Aziz and Simon Mackenzie . 2016b. A discrete and bounded envy-free cake cutting protocol for four agents. STOC ( 2016 ). Haris Aziz and Simon Mackenzie. 2016b. A discrete and bounded envy-free cake cutting protocol for four agents. STOC (2016)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13129-0_1"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"26","author":"Bei Xiaohui","year":"2012","unstructured":"Xiaohui Bei , Ning Chen , Xia Hua , Biaoshuai Tao , and Endong Yang . 2012 . Optimal proportional cake cutting with connected pieces . In Proceedings of the AAAI Conference on Artificial Intelligence , Vol. 26 . Xiaohui Bei, Ning Chen, Xia Hua, Biaoshuai Tao, and Endong Yang. 2012. Optimal proportional cake cutting with connected pieces. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 26."},{"key":"e_1_3_2_1_11_1","volume-title":"Cake Cutting: Envy and Truth.. In IJCAI. 3625--3631.","author":"Bei Xiaohui","year":"2017","unstructured":"Xiaohui Bei , Ning Chen , Guangda Huzhang , Biaoshuai Tao , and Jiajun Wu . 2017 . Cake Cutting: Envy and Truth.. In IJCAI. 3625--3631. Xiaohui Bei, Ning Chen, Guangda Huzhang, Biaoshuai Tao, and Jiajun Wu. 2017. Cake Cutting: Envy and Truth.. In IJCAI. 3625--3631."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00355-020-01256-0"},{"key":"e_1_3_2_1_13_1","volume-title":"The price of fairness. Operations research","author":"Bertsimas Dimitris","year":"2011","unstructured":"Dimitris Bertsimas , Vivek F Farias , and Nikolaos Trichakis . 2011. The price of fairness. Operations research , Vol. 59 , 1 ( 2011 ), 17--31. Dimitris Bertsimas, Vivek F Farias, and Nikolaos Trichakis. 2011. The price of fairness. Operations research, Vol. 59, 1 (2011), 17--31."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"26","author":"Brams Steven","year":"2012","unstructured":"Steven Brams , Michal Feldman , John Lai , Jamie Morgenstern , and Ariel Procaccia . 2012 . On maxsum fair cake divisions . In Proceedings of the AAAI Conference on Artificial Intelligence , Vol. 26 . Steven Brams, Michal Feldman, John Lai, Jamie Morgenstern, and Ariel Procaccia. 2012. On maxsum fair cake divisions. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 26."},{"key":"e_1_3_2_1_15_1","volume-title":"Steven John Brams, and Alan D Taylor","author":"Brams Steven J","year":"1996","unstructured":"Steven J Brams , Steven John Brams, and Alan D Taylor . 1996 . Fair Division : From cake-cutting to dispute resolution. Cambridge University Press . Steven J Brams, Steven John Brams, and Alan D Taylor. 1996. Fair Division: From cake-cutting to dispute resolution. Cambridge University Press."},{"key":"e_1_3_2_1_16_1","first-page":"1314","article-title":"Better ways to cut a cake","volume":"53","author":"Brams Steven J","year":"2006","unstructured":"Steven J Brams , Michael A Jones , and Christian Klamler . 2006 . Better ways to cut a cake . Notices of the AMS , Vol. 53 , 11 (2006), 1314 -- 1321 . Steven J Brams, Michael A Jones, and Christian Klamler. 2006. Better ways to cut a cake. Notices of the AMS, Vol. 53, 11 (2006), 1314--1321.","journal-title":"Notices of the AMS"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1995.11990526"},{"key":"e_1_3_2_1_18_1","volume-title":"Handbook of computational social choice","author":"Brandt Felix","unstructured":"Felix Brandt , Vincent Conitzer , Ulle Endriss , J\u00e9r\u00f4me Lang , and Ariel D Procaccia . 2016. Handbook of computational social choice . Cambridge University Press . Felix Brandt, Vincent Conitzer, Ulle Endriss, J\u00e9r\u00f4me Lang, and Ariel D Procaccia. 2016. Handbook of computational social choice. Cambridge University Press."},{"key":"e_1_3_2_1_19_1","volume-title":"A dictatorship theorem for cake cutting. IJCAI","author":"Br\u00e2nzei Simina","year":"2015","unstructured":"Simina Br\u00e2nzei and Peter Bro Miltersen . 2015. A dictatorship theorem for cake cutting. IJCAI ( 2015 ), 482--488. Simina Br\u00e2nzei and Peter Bro Miltersen. 2015. A dictatorship theorem for cake cutting. IJCAI (2015), 482--488."},{"key":"e_1_3_2_1_20_1","volume-title":"The query complexity of cake cutting. arXiv preprint arXiv:1705.02946","author":"Br\u00e2nzei Simina","year":"2017","unstructured":"Simina Br\u00e2nzei and Noam Nisan . 2017. The query complexity of cake cutting. arXiv preprint arXiv:1705.02946 ( 2017 ). Simina Br\u00e2nzei and Noam Nisan. 2017. The query complexity of cake cutting. arXiv preprint arXiv:1705.02946 (2017)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-011-9359-y"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Y. Chen J. Lai D. Parkes and A. Procaccia. 2010. Truth justice and cake cutting. In AAAI. 756--761.  Y. Chen J. Lai D. Parkes and A. Procaccia. 2010. Truth justice and cake cutting. In AAAI. 756--761.","DOI":"10.1609\/aaai.v24i1.7621"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/2900423.2900523"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2448473.2448478"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1961.11989615"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.17"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109588"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90005-2"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.12222"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8629"},{"key":"e_1_3_2_1_31_1","volume-title":"Twenty-Fourth International Joint Conference on Artificial Intelligence.","author":"Li Minming","year":"2015","unstructured":"Minming Li , Jialin Zhang , and Qiang Zhang . 2015 . Truthful cake cutting mechanisms with externalities: Do not make them care for others too much! . In Twenty-Fourth International Joint Conference on Artificial Intelligence. Minming Li, Jialin Zhang, and Qiang Zhang. 2015. Truthful cake cutting mechanisms with externalities: Do not make them care for others too much!. In Twenty-Fourth International Joint Conference on Artificial Intelligence."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35311-6_13"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/50"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16170-4_25"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2483852.2483870"},{"key":"e_1_3_2_1_36_1","volume-title":"Twenty-First International Joint Conference on Artificial Intelligence.","author":"Procaccia Ariel D","year":"2009","unstructured":"Ariel D Procaccia . 2009 . Thou shalt covet thy neighbor's cake . In Twenty-First International Joint Conference on Artificial Intelligence. Ariel D Procaccia. 2009. Thou shalt covet thy neighbor's cake. In Twenty-First International Joint Conference on Artificial Intelligence."},{"key":"e_1_3_2_1_37_1","volume-title":"Cake-cutting algorithms: Be fair if you can","author":"Robertson Jack","unstructured":"Jack Robertson and William Webb . 1998. Cake-cutting algorithms: Be fair if you can . CRC Press . Jack Robertson and William Webb. 1998. Cake-cutting algorithms: Be fair if you can .CRC Press."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0500-z"},{"key":"e_1_3_2_1_39_1","first-page":"101","article-title":"The Problem of Fair Division","volume":"16","author":"Steinhaus Hugo","year":"1948","unstructured":"Hugo Steinhaus . 1948 . The Problem of Fair Division . Econometrica , Vol. 16 , 1 (1948), 101 -- 104 . Hugo Steinhaus. 1948. The Problem of Fair Division. Econometrica, Vol. 16, 1 (1948), 101--104.","journal-title":"Econometrica"},{"key":"e_1_3_2_1_40_1","volume-title":"Envy-free cake divisions cannot be found by finite protocols. the electronic journal of combinatorics","author":"Stromquist Walter","year":"2008","unstructured":"Walter Stromquist . 2008. Envy-free cake divisions cannot be found by finite protocols. the electronic journal of combinatorics , Vol. 15 , 1 ( 2008 ), R11. Walter Stromquist. 2008. Envy-free cake divisions cannot be found by finite protocols. the electronic journal of combinatorics, Vol. 15, 1 (2008), R11."},{"key":"e_1_3_2_1_41_1","volume-title":"Rental harmony: Sperner's lemma in fair division. The American mathematical monthly","author":"Francis Edward Su.","year":"1999","unstructured":"Francis Edward Su. 1999. Rental harmony: Sperner's lemma in fair division. The American mathematical monthly , Vol. 106 , 10 ( 1999 ), 930--942. Francis Edward Su. 1999. Rental harmony: Sperner's lemma in fair division. The American mathematical monthly, Vol. 106, 10 (1999), 930--942."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.3.319"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(83)90074-1"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2019.104970"}],"event":{"name":"EC '22: The 23rd ACM Conference on Economics and Computation","location":"Boulder CO USA","acronym":"EC '22","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 23rd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538321","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538321","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:59Z","timestamp":1750186979000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":44,"alternative-id":["10.1145\/3490486.3538321","10.1145\/3490486"],"URL":"https:\/\/doi.org\/10.1145\/3490486.3538321","relation":{},"subject":[],"published":{"date-parts":[[2022,7,12]]},"assertion":[{"value":"2022-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}