{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:50:22Z","timestamp":1787500222830,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["1892947"],"award-info":[{"award-number":["1892947"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1145\/3465456.3467625","type":"proceedings-article","created":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T06:28:50Z","timestamp":1626589730000},"page":"347-368","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents"],"prefix":"10.1145","author":[{"given":"Argyrios","family":"Deligkas","sequence":"first","affiliation":[{"name":"Royal Holloway University of London, London, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aris","family":"Filos-Ratsikas","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexandros","family":"Hollender","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2019.09.002"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(87)90055-7"},{"key":"e_1_3_2_1_3_1","volume-title":"Efficient Splitting of Measures and Necklaces. arxiv","author":"Alon Noga","year":"2006","unstructured":"Noga Alon and Andrei Graur . 2020. Efficient Splitting of Measures and Necklaces. arxiv : 2006 .16613 Noga Alon and Andrei Graur. 2020. Efficient Splitting of Measures and Necklaces. arxiv: 2006.16613"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1986-0861764-9"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99660-8_9"},{"key":"e_1_3_2_1_6_1","volume-title":"Three's a Crowd: Consensus-Halving for a Constant Number of Agents. arxiv","author":"Filos-Ratsikas Argyrios Aris","year":"2007","unstructured":"Aris Filos-Ratsikas Argyrios Deligkas and Alexandros Hollender . 2020. Two's Company , Three's a Crowd: Consensus-Halving for a Constant Number of Agents. arxiv : 2007 .15125 Aris Filos-Ratsikas Argyrios Deligkas and Alexandros Hollender. 2020. Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents. arxiv: 2007.15125"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2307\/3616548"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.52"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897522"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399512"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1575"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4064\/fm-20-1-177-190"},{"key":"e_1_3_2_1_13_1","volume-title":"Taylor","author":"Brams Steven J.","year":"1996","unstructured":"Steven J. Brams and Alan D . Taylor . 1996 . Fair Division : From cake-cutting to dispute resolution .Cambridge University Press . https:\/\/doi.org\/10.1017\/CBO9780511598975 Steven J. Brams and Alan D. Taylor. 1996. Fair Division: From cake-cutting to dispute resolution .Cambridge University Press. https:\/\/doi.org\/10.1017\/CBO9780511598975"},{"key":"e_1_3_2_1_14_1","unstructured":"Simina Br\u00e2nzei and Noam Nisan. 2017. The Query Complexity of Cake Cutting. arxiv: 1705.02946  Simina Br\u00e2nzei and Noam Nisan. 2017. The Query Complexity of Cake Cutting. arxiv: 1705.02946"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329644"},{"key":"e_1_3_2_1_16_1","first-page":"11","volume-title":"Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI). 127--132","author":"Caragiannis Ioannis","unstructured":"Ioannis Caragiannis , John K. Lai , and Ariel D. Procaccia . 2011. Towards more expressive cake cutting . In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI). 127--132 . https:\/\/doi.org\/10.5591\/978--1--57735--516--8\/IJCAI 11 - 033 Ioannis Caragiannis, John K. Lai, and Ariel D. Procaccia. 2011. Towards more expressive cake cutting. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI). 127--132. https:\/\/doi.org\/10.5591\/978--1--57735--516--8\/IJCAI11-033"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1379759.1379761"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516516"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/070699652"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 790--804","author":"Daskalakis Constantinos","year":"1973","unstructured":"Constantinos Daskalakis and Christos H. Papadimitriou . 2011. Continuous local search . In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 790--804 . https:\/\/doi.org\/10.1137\/1.978161 1973 082.62 Constantinos Daskalakis and Christos H. Papadimitriou. 2011. Continuous local search. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 790--804. https:\/\/doi.org\/10.1137\/1.9781611973082.62"},{"key":"e_1_3_2_1_21_1","volume-title":"Square-Cut Pizza Sharing is PPA-complete. arxiv","author":"Deligkas Argyrios","year":"2012","unstructured":"Argyrios Deligkas , John Fearnley , and Themistoklis Melissourgos . 2020. Square-Cut Pizza Sharing is PPA-complete. arxiv : 2012 .14236 Argyrios Deligkas, John Fearnley, and Themistoklis Melissourgos. 2020. Square-Cut Pizza Sharing is PPA-complete. arxiv: 2012.14236"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2020.10.006"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/2448473.2448478"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1110.0511"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1958033.1958052"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451052"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS). 24:1--24:16","author":"Filos-Ratsikas Aris","year":"2018","unstructured":"Aris Filos-Ratsikas , S\u00f8ren Kristoffer Still Frederiksen , Paul W. Goldberg , and Jie Zhang . 2018 . Hardness Results for Consensus-Halving . In Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS). 24:1--24:16 . https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2018.24 Aris Filos-Ratsikas, S\u00f8ren Kristoffer Still Frederiksen, Paul W. Goldberg, and Jie Zhang. 2018. Hardness Results for Consensus-Halving. In Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS). 24:1--24:16. https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2018.24"},{"key":"e_1_3_2_1_28_1","volume-title":"Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC). 51--64","author":"Filos-Ratsikas Aris","year":"1887","unstructured":"Aris Filos-Ratsikas and Paul W. Goldberg . 2018. Consensus Halving is PPA-complete . In Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC). 51--64 . https:\/\/doi.org\/10.1145\/3 1887 45.3188880 Aris Filos-Ratsikas and Paul W. Goldberg. 2018. Consensus Halving is PPA-complete. In Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC). 51--64. https:\/\/doi.org\/10.1145\/3188745.3188880"},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings of the 51st Annual ACM Symposium on Theory of Computing (STOC). 638--649","author":"Filos-Ratsikas Aris","unstructured":"Aris Filos-Ratsikas and Paul W. Goldberg . 2019. The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches . In Proceedings of the 51st Annual ACM Symposium on Theory of Computing (STOC). 638--649 . https:\/\/doi.org\/10.1145\/3313276.3316334 Aris Filos-Ratsikas and Paul W. Goldberg. 2019. The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches. In Proceedings of the 51st Annual ACM Symposium on Theory of Computing (STOC). 638--649. https:\/\/doi.org\/10.1145\/3313276.3316334"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399527"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.155"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/0606010"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00152-6"},{"key":"e_1_3_2_1_34_1","first-page":"665","article-title":"A moment problem in L1 approximation","volume":"16","author":"Hobby Charles R.","year":"1965","unstructured":"Charles R. Hobby and John R. Rice . 1965 . A moment problem in L1 approximation . Proc. Amer. Math. Soc. , Vol. 16 , 4 (1965), 665 -- 670 . https:\/\/doi.org\/10.2307\/2033900 Charles R. Hobby and John R. Rice. 1965. A moment problem in L1 approximation. Proc. Amer. Math. Soc., Vol. 16, 4 (1965), 665--670. https:\/\/doi.org\/10.2307\/2033900","journal-title":"Proc. Amer. Math. Soc."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-016-1303-z"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341106"},{"key":"e_1_3_2_1_37_1","volume-title":"Using the Borsuk-Ulam theorem: lectures on topological methods in combinatorics and geometry","author":"Matouvsek Jivr\u00ed","unstructured":"Jivr\u00ed Matouvsek . 2008. Using the Borsuk-Ulam theorem: lectures on topological methods in combinatorics and geometry . Springer Science & Business Media . https:\/\/doi.org\/10.1007\/978--3--540--76649-0 Jivr\u00ed Matouvsek. 2008. Using the Borsuk-Ulam theorem: lectures on topological methods in combinatorics and geometry. Springer Science & Business Media. https:\/\/doi.org\/10.1007\/978--3--540--76649-0"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90200-L"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2014.01.008"},{"key":"e_1_3_2_1_40_1","first-page":"843","article-title":"Un th\u00e9or\u00e8me d'existence","volume":"222","author":"Neyman Jerzy","year":"1946","unstructured":"Jerzy Neyman . 1946 . Un th\u00e9or\u00e8me d'existence . CR Acad. Sci. Paris , Vol. 222 (1946), 843 -- 845 . Jerzy Neyman. 1946. Un th\u00e9or\u00e8me d'existence. CR Acad. Sci. Paris, Vol. 222 (1946), 843--845.","journal-title":"CR Acad. Sci. Paris"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80063-7"},{"key":"e_1_3_2_1_42_1","volume-title":"Handbook of Computational Social Choice","author":"Procaccia Ariel D.","unstructured":"Ariel D. Procaccia . 2016. Cake Cutting Algorithms . In Handbook of Computational Social Choice . Cambridge University Press , 311--330. Ariel D. Procaccia. 2016. Cake Cutting Algorithms. In Handbook of Computational Social Choice. Cambridge University Press, 311--330."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(95)90073-X"},{"key":"e_1_3_2_1_44_1","volume-title":"Webb","author":"Robertson Jack M.","year":"1998","unstructured":"Jack M. Robertson and William A . Webb . 1998 . Cake-cutting algorithms: Be fair if you can .CRC Press . Jack M. Robertson and William A. Webb. 1998. Cake-cutting algorithms: Be fair if you can .CRC Press."},{"key":"e_1_3_2_1_45_1","volume-title":"Su","author":"Simmons Forest W.","year":"2003","unstructured":"Forest W. Simmons and Francis E . Su . 2003 . Consensus-Halving via theorems of Borsuk-Ulam and Tucker. Mathematical social sciences, Vol. 45 , 1 (2003), 15--25. https:\/\/doi.org\/10.1016\/S0165--4896(02)00087--2 Forest W. Simmons and Francis E. Su. 2003. Consensus-Halving via theorems of Borsuk-Ulam and Tucker. Mathematical social sciences, Vol. 45, 1 (2003), 15--25. https:\/\/doi.org\/10.1016\/S0165--4896(02)00087--2"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.2307\/2589747"},{"key":"e_1_3_2_1_47_1","volume-title":"Proceedings of the First Canadian Math. Congress, Montreal","author":"Tucker Albert W.","year":"1945","unstructured":"Albert W. Tucker . 1945 . Some Topological Properties of Disk and Sphere . In Proceedings of the First Canadian Math. Congress, Montreal . University of Toronto Press, 286--309. Albert W. Tucker. 1945. Some Topological Properties of Disk and Sphere. In Proceedings of the First Canadian Math. Congress, Montreal. University of Toronto Press, 286--309."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2006.07.003"}],"event":{"name":"EC '21: The 22nd ACM Conference on Economics and Computation","location":"Budapest Hungary","acronym":"EC '21","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 22nd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467625","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467625","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:17:28Z","timestamp":1750177048000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467625"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":48,"alternative-id":["10.1145\/3465456.3467625","10.1145\/3465456"],"URL":"https:\/\/doi.org\/10.1145\/3465456.3467625","relation":{},"subject":[],"published":{"date-parts":[[2021,7,18]]},"assertion":[{"value":"2021-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}