{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:31:51Z","timestamp":1767339111375,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1122\/22"],"award-info":[{"award-number":["1122\/22"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,7]]},"DOI":"10.1145\/3736252.3742553","type":"proceedings-article","created":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:48:05Z","timestamp":1751482085000},"page":"358-382","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Low communication protocols for fair allocation of indivisible goods"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-3749-4392","authenticated-orcid":false,"given":"Uriel","family":"Feige","sequence":"first","affiliation":[{"name":"Weizmann Institute, Rehovot, Israel"}]}],"member":"320","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580507.3597799"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.4"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i13.33476"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2023.103965"},{"key":"e_1_3_2_1_5_1","volume-title":"WINE 2022, Proceedings (Lecture Notes in Computer Science","volume":"255","author":"Babaioff Moshe","year":"2022","unstructured":"Moshe Babaioff, Tomer Ezra, and Uriel Feige. 2022. On Best-of-Both-Worlds Fair-Share Allocations. In Web and Internet Economics - 18th International Conference, WINE 2022, Proceedings (Lecture Notes in Computer Science, Vol. 13778), Kristoffer Arnsfelt Hansen, Tracy Xiao Liu, and Azarakhsh Malekian (Eds.). 237\u2013255."},{"key":"e_1_3_2_1_6_1","volume-title":"Domination and Incentives. In EC '22: The 23rd ACM Conference on Economics and Computation","author":"Babaioff Moshe","year":"2022","unstructured":"Moshe Babaioff and Uriel Feige. 2022. Fair Shares: Feasibility, Domination and Incentives. In EC '22: The 23rd ACM Conference on Economics and Computation, 2022. ACM, 435."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3381525"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2021.11.006"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329644"},{"key":"e_1_3_2_1_10_1","volume-title":"The Query Complexity of Cake Cutting. In Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022","author":"Br\u00e2nzei Simina","year":"2022","unstructured":"Simina Br\u00e2nzei and Noam Nisan. 2022. The Query Complexity of Cake Cutting. In Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022."},{"key":"e_1_3_2_1_11_1","unstructured":"Xiaolin Bu Zihao Li Shengxin Liu Jiaxin Song and Biaoshuai Tao. 2024. Fair Division of Indivisible Goods with Comparison-Based Queries. arXiv:2404.18133 [cs.GT]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1086\/664613"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/284"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355902"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085125"},{"key":"e_1_3_2_1_16_1","volume-title":"Balanced Allocations of Cake. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS),. IEEE Computer Society, 623\u2013634","author":"Edmonds Jeff","year":"2006","unstructured":"Jeff Edmonds and Kirk Pruhs. 2006. Balanced Allocations of Cake. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS),. IEEE Computer Society, 623\u2013634."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000807.2000819"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90005-2"},{"key":"e_1_3_2_1_19_1","volume-title":"Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers. In 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS","author":"Ezra Tomer","year":"2019","unstructured":"Tomer Ezra, Michal Feldman, Eric Neyman, Inbal Talgam-Cohen, and S. Matthew Weinberg. 2019. Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers. In 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019. IEEE Computer Society, 249\u2013272."},{"key":"e_1_3_2_1_20_1","unstructured":"Uriel Feige. 2022. Maximin fair allocations with two item values. https:\/\/www.wisdom.weizmann.ac.il\/~feige\/mypapers\/MMSab.pdf"},{"key":"e_1_3_2_1_21_1","volume-title":"Low communication protocols for fair allocation of indivisible goods. CoRR abs\/2407.07641","author":"Feige Uriel","year":"2024","unstructured":"Uriel Feige. 2024. Low communication protocols for fair allocation of indivisible goods. CoRR abs\/2407.07641 (2024)."},{"key":"e_1_3_2_1_22_1","volume-title":"International Conference on Web and Internet Economics. Springer, 355\u2013372","author":"Feige Uriel","year":"2021","unstructured":"Uriel Feige, Ariel Sapir, and Laliv Tauber. 2021. A tight negative example for MMS fair allocations. In International Conference on Web and Internet Economics. Springer, 355\u2013372."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0605009"},{"key":"e_1_3_2_1_24_1","unstructured":"George Gamow and Marvin Stern. 1958. Puzzle-math. Viking Press. https:\/\/books.google.co.il\/books?id=_vdytgAACAAJ"},{"key":"e_1_3_2_1_25_1","volume-title":"Approximating Maximin Share Allocations. In 2nd Symposium on Simplicity in Algorithms (SOSA). 20:1\u201320:11","author":"Garg Jugal","year":"2019","unstructured":"Jugal Garg, Peter McGlaughlin, and Setareh Taki. 2019. Approximating Maximin Share Allocations. In 2nd Symposium on Simplicity in Algorithms (SOSA). 20:1\u201320:11."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i5.25705"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3140756"},{"key":"e_1_3_2_1_28_1","volume-title":"Communication complexity","author":"Kushilevitz Eyal","unstructured":"Eyal Kushilevitz and Noam Nisan. 1997. Communication complexity. Cambridge University Press."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988792"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2004.10.007"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1313349"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M124397X"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1244305"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2019.01.036"},{"key":"e_1_3_2_1_35_1","volume-title":"18th Annual Symposium on Foundations of Computer Science","author":"Chi-Chih Yao Andrew","year":"1977","unstructured":"Andrew Chi-Chih Yao. 1977. Probabilistic Computations: Toward a Unified Measure of Complexity (Extended Abstract). In 18th Annual Symposium on Foundations of Computer Science, 1977. IEEE Computer Society, 222\u2013227."}],"event":{"name":"EC '25: 26th ACM Conference on Economics and Computation","location":"Stanford University Stanford CA USA","acronym":"EC '25","sponsor":["SIGecom ACM Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 26th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3736252.3742553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:48:38Z","timestamp":1751482118000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3736252.3742553"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"references-count":35,"alternative-id":["10.1145\/3736252.3742553","10.1145\/3736252"],"URL":"https:\/\/doi.org\/10.1145\/3736252.3742553","relation":{},"subject":[],"published":{"date-parts":[[2025,7,2]]},"assertion":[{"value":"2025-07-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}