{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T06:21:37Z","timestamp":1768285297411,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:00:00Z","timestamp":1720396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["866132"],"award-info":[{"award-number":["866132"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,8]]},"DOI":"10.1145\/3670865.3673592","type":"proceedings-article","created":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T20:13:33Z","timestamp":1734466413000},"page":"1236-1266","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Breaking the Envy Cycle: Best-of-Both-Worlds Guarantees for Subadditive Valuations"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2915-8405","authenticated-orcid":false,"given":"Michal","family":"Feldman","sequence":"first","affiliation":[{"name":"Tel Aviv University, Microsoft ILDC, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4080-3118","authenticated-orcid":false,"given":"Simon","family":"Mauras","sequence":"additional","affiliation":[{"name":"Tel Aviv University, INRIA, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-8844-9969","authenticated-orcid":false,"given":"Vishnu V.","family":"Narayan","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9240-7398","authenticated-orcid":false,"given":"Tomasz","family":"Ponitka","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,12,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Jugal Garg, Kurt Mehlhorn, and Ruta Mehta.","author":"Akrami Hannaneh","year":"2022","unstructured":"Hannaneh Akrami, Noga Alon, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, and Ruta Mehta. 2022. EFX Allocations: Simplifications and Improvements. CoRR abs\/2205.07638 (2022)."},{"key":"e_1_3_2_1_2_1","unstructured":"Hannaneh Akrami Kurt Mehlhorn Masoud Seddighin and Golnoosh Shahkarami. 2023. Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations. arXiv:2308.14545 [cs.GT]"},{"key":"e_1_3_2_1_3_1","volume-title":"Online Fair Division: Analysing a Food Bank Problem","author":"Aleksandrov Martin","unstructured":"Martin Aleksandrov, Haris Aziz, Serge Gaspers, and Toby Walsh. 2015. Online Fair Division: Analysing a Food Bank Problem. In IJCAI. AAAI Press, 2540--2546."},{"key":"e_1_3_2_1_4_1","volume-title":"Multiple Birds with One Stone: Beating 1\/2 for EFX and GMMS via Envy Cycle Elimination","author":"Amanatidis Georgios","unstructured":"Georgios Amanatidis, Evangelos Markakis, and Apostolos Ntokos. 2020. Multiple Birds with One Stone: Beating 1\/2 for EFX and GMMS via Envy Cycle Elimination. In AAAI. AAAI Press, 1790--1797."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Haris Aziz. 2019. A Probabilistic Approach to Voting Allocation Matching and Coalition Formation. 45--50.","DOI":"10.1007\/978-3-030-18050-8_8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64946-3_24"},{"key":"e_1_3_2_1_7_1","unstructured":"Haris Aziz Aditya Ganguly and Evi Micha. 2023a. Best of Both Worlds Fairness under Entitlements. In AAMAS."},{"key":"e_1_3_2_1_8_1","unstructured":"Haris Aziz Xinhang Lu Mashbat Suzuki Jeremy Vollen and Toby Walsh. 2023b. Best-of-Both-Worlds Fairness in Committee Voting. arXiv:2303.03642 [cs.GT]"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Haris Aziz Xinhang Lu Mashbat Suzuki Jeremy Vollen and Toby Walsh. 2024. Fair Lotteries for Participatory Budgeting. (2024).","DOI":"10.1609\/aaai.v38i9.28801"},{"key":"e_1_3_2_1_10_1","volume-title":"A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents","author":"Aziz Haris","unstructured":"Haris Aziz and Simon Mackenzie. 2016. A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents. In FOCS. IEEE Computer Society, 416--427."},{"key":"e_1_3_2_1_11_1","volume-title":"Fair and Truthful Mechanisms for Dichotomous Valuations","author":"Babaioff Moshe","unstructured":"Moshe Babaioff, Tomer Ezra, and Uriel Feige. 2021. Fair and Truthful Mechanisms for Dichotomous Valuations. In AAAI. AAAI Press, 5119--5126."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22832-2_14"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11463"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3381525"},{"key":"e_1_3_2_1_15_1","volume-title":"Almost Full EFX Exists for Four Agents","author":"Berger Ben","unstructured":"Ben Berger, Avi Cohen, Michal Feldman, and Amos Fiat. 2022. Almost Full EFX Exists for Four Agents. In AAAI. AAAI Press, 4826--4833."},{"key":"e_1_3_2_1_16_1","first-page":"1","article-title":"On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources. In APPROX-RANDOM (LIPIcs, Vol. 207)","volume":"1","author":"Bhaskar Umang","year":"2021","unstructured":"Umang Bhaskar, A. R. Sricharan, and Rohit Vaish. 2021. On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources. In APPROX-RANDOM (LIPIcs, Vol. 207). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 1:1--1:23.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_17_1","first-page":"147","article-title":"Three observations on linear algebra","volume":"5","author":"Birkhoff Garrett","year":"1946","unstructured":"Garrett Birkhoff. 1946. Three observations on linear algebra. Univ. Nac. Tacuman, Rev. Ser. A 5 (1946), 147--151.","journal-title":"Univ. Nac. Tacuman, Rev. Ser. A"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.2000.2710"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1995.11990526"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1086\/664613"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Ioannis Caragiannis David Kurokawa Herv\u00e9 Moulin Ariel D. Procaccia Nisarg Shah and Junxing Wang. 2016. The Unreasonable Fairness of Maximum Nash Welfare. In EC. ACM 305--322.","DOI":"10.1145\/2940716.2940726"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/20"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Bhaskar Ray Chaudhury Jugal Garg and Kurt Mehlhorn. 2020a. EFX Exists for Three Agents. In EC. ACM 1--19.","DOI":"10.1145\/3391403.3399511"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Bhaskar Ray Chaudhury Jugal Garg Kurt Mehlhorn Ruta Mehta and Pranabendu Misra. 2021. Improving EFX Guarantees through Rainbow Cycle Number. In EC. ACM 310--311.","DOI":"10.1145\/3465456.3467605"},{"key":"e_1_3_2_1_25_1","volume-title":"A Little Charity Guarantees Almost Envy-Freeness","author":"Chaudhury Bhaskar Ray","unstructured":"Bhaskar Ray Chaudhury, Telikepalli Kavitha, Kurt Mehlhorn, and Alkmini Sgouritsa. 2020b. A Little Charity Guarantees Almost Envy-Freeness. In SODA. SIAM, 2658--2672."},{"key":"e_1_3_2_1_26_1","first-page":"119","article-title":"Aristotle's conception of equity (epieikeia)","volume":"18","author":"Chroust Anton-Hermann","year":"1942","unstructured":"Anton-Hermann Chroust. 1942. Aristotle's conception of equity (epieikeia). Notre Dame Law Review 18 (1942), 119--128.","journal-title":"Notre Dame Law Review"},{"key":"e_1_3_2_1_27_1","volume-title":"WINE (Lecture Notes in Computer Science","volume":"372","author":"Feige Uriel","year":"2021","unstructured":"Uriel Feige, Ariel Sapir, and Laliv Tauber. 2021. A Tight Negative Example for MMS Fair Allocations. In WINE (Lecture Notes in Computer Science, Vol. 13112). Springer, 355--372."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i9.28826"},{"key":"e_1_3_2_1_29_1","first-page":"45","article-title":"Resource allocation and the public sector","volume":"7","author":"Foley D.","year":"1967","unstructured":"D. Foley. 1967. Resource allocation and the public sector. Yale Econ Essays 7, 1 (1967), 45--98.","journal-title":"Yale Econ Essays"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Rupert Freeman Nisarg Shah and Rohit Vaish. 2020. Best of Both Worlds: Ex-Ante and Ex-Post Fairness in Resource Allocation. In EC. ACM 21--22.","DOI":"10.1145\/3391403.3399537"},{"key":"e_1_3_2_1_31_1","volume-title":"Masoud Seddighin, Saeed Seddighin, and Hadi Yami.","author":"Ghodsi Mohammad","year":"2018","unstructured":"Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, and Hadi Yami. 2018. Fair Allocation of Indivisible Goods: Improvements and Generalizations. In EC. ACM, 539--556."},{"key":"e_1_3_2_1_32_1","volume-title":"EFX Exists for Four Agents with Three Types of Valuations. arXiv preprint arXiv:2301.10632","author":"Ghosal Pratik","year":"2023","unstructured":"Pratik Ghosal, Vishwa Prakash H.V., Prajakta Nimbhorkar, and Nithin Varma. 2023. EFX Exists for Four Agents with Three Types of Valuations. arXiv preprint arXiv:2301.10632 (2023)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64946-3_26"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Martin Hoefer Marco Schmalhofer and Giovanna Varricchio. 2023. Best of Both Worlds: Agents with Entitlements. In AAMAS.","DOI":"10.1613\/jair.1.15595"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Richard J. Lipton Evangelos Markakis Elchanan Mossel and Amin Saberi. 2004. On approximately fair allocations of indivisible goods. In EC. ACM 125--131.","DOI":"10.1145\/988772.988792"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176994365"},{"key":"e_1_3_2_1_37_1","volume-title":"29th Annual European Symposium on Algorithms (ESA","author":"Mahara Ryoga","year":"2021","unstructured":"Ryoga Mahara. 2021. Extension of Additive Valuations to General Valuations on the Existence of EFX. In 29th Annual European Symposium on Algorithms (ESA 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_38_1","volume-title":"Markov chains. Number 2","author":"Norris James R","unstructured":"James R Norris. 1998. Markov chains. Number 2. Cambridge university press."},{"key":"e_1_3_2_1_39_1","volume-title":"Almost Envy-Freeness with General Valuations","author":"Plaut Benjamin","unstructured":"Benjamin Plaut and Tim Roughgarden. 2018. Almost Envy-Freeness with General Valuations. In SODA. SIAM, 2584--2603."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382131"},{"key":"e_1_3_2_1_41_1","volume-title":"Procaccia and Junxing Wang","author":"Ariel","year":"2014","unstructured":"Ariel D. Procaccia and Junxing Wang. 2014. Fair enough: guaranteeing approximate maximin shares. In EC. ACM, 675--692."},{"key":"e_1_3_2_1_42_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 16 (1948), 101--104.","journal-title":"Econometrica"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1980.11995109"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(74)90075-1"},{"key":"e_1_3_2_1_45_1","volume-title":"A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the Theory of Games 2, 0","author":"Neumann John Von","year":"1953","unstructured":"John Von Neumann. 1953. A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the Theory of Games 2, 0 (1953), 5--12."}],"event":{"name":"EC '24: 25th ACM Conference on Economics and Computation","location":"New Haven CT USA","acronym":"EC '24","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 25th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673592","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673592","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:01Z","timestamp":1750295401000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673592"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":45,"alternative-id":["10.1145\/3670865.3673592","10.1145\/3670865"],"URL":"https:\/\/doi.org\/10.1145\/3670865.3673592","relation":{},"subject":[],"published":{"date-parts":[[2024,7,8]]},"assertion":[{"value":"2024-12-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}