{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:17:16Z","timestamp":1751516236752,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CAREER award CCF-2047907"],"award-info":[{"award-number":["CAREER award CCF-2047907"]}],"id":[{"id":"10.13039\/100000001","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.3742613","type":"proceedings-article","created":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:48:05Z","timestamp":1751482085000},"page":"689-718","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Simultaneously Satisfying MXS and EFL"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-2953-3714","authenticated-orcid":false,"given":"Arash","family":"Ashuri","sequence":"first","affiliation":[{"name":"Sharif University of Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7203-438X","authenticated-orcid":false,"given":"Vasilis","family":"Gkatzelis","sequence":"additional","affiliation":[{"name":"Drexel University, Philadelphia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"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.24963\/ijcai.2023\/276"},{"key":"e_1_3_2_1_4_1","volume-title":"Achieving Maximin Share and EFX\/EF1 Guarantees Simultaneously. CoRR abs\/2409.01963","author":"Akrami Hannaneh","year":"2024","unstructured":"Hannaneh Akrami and Nidhi Rathi. 2024a. Achieving Maximin Share and EFX\/EF1 Guarantees Simultaneously. CoRR abs\/2409.01963 (2024)."},{"key":"e_1_3_2_1_5_1","volume-title":"Epistemic EFX Allocations Exist for Monotone Valuations. CoRR abs\/2405.14463","author":"Akrami Hannaneh","year":"2024","unstructured":"Hannaneh Akrami and Nidhi Rathi. 2024b. Epistemic EFX Allocations Exist for Monotone Valuations. CoRR abs\/2405.14463 (2024). arXiv:2405.14463 Georgios Amanatidis, Haris Aziz, Georgios Birmpas, Aris Filos-Ratsikas, Bo Li, Herv\u00e9 Moulin, Alexandros A. Voudouris, and Xiaowei Wu. 2023. Fair division of indivisible goods: Recent progress and open questions. Artif. Intell. 322 (2023), 103965."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.02.020"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Georgios Amanatidis Georgios Birmpas and Vangelis Markakis. 2018. Comparing Approximate Relaxations of Envy-Freeness. ijcai.org 42\u201348.","DOI":"10.24963\/ijcai.2018\/6"},{"key":"e_1_3_2_1_8_1","volume-title":"42nd International Colloquium (Lecture Notes in Computer Science","volume":"51","author":"Amanatidis Georgios","year":"2015","unstructured":"Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, and Amin Saberi. 2015. Approximation Algorithms for Computing Maximin Share Allocations. In Automata, Languages, and Programming - 42nd International Colloquium (Lecture Notes in Computer Science, Vol. 9134). Springer, 39\u201351."},{"key":"e_1_3_2_1_9_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. AAAI Press, 1790\u20131797."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Arash Ashuri Vasilis Gkatzelis and Alkmini Sgouritsa. 2024. EF2X Exists For Four Agents. arXiv:2412.00254 [cs.GT] https:\/\/arxiv.org\/abs\/2412.00254","DOI":"10.1609\/aaai.v39i13.33480"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2020.07.005"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/4"},{"key":"e_1_3_2_1_13_1","volume-title":"Sanath Kumar Krishna Murthy, and Yadati Narahari","author":"Barman Siddharth","year":"2018","unstructured":"Siddharth Barman, Arpita Biswas, Sanath Kumar Krishna Murthy, and Yadati Narahari. 2018. Groupwise Maximin Fair Allocation of Indivisible Goods. AAAI Press, 917\u2013924."},{"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. AAAI Press, 4826\u20134833."},{"key":"e_1_3_2_1_16_1","first-page":"1","article-title":"The combinatorial assignment problem: approximate competitive equilibrium from equal incomes, Moshe Dror and Greys Sosic (Eds.)","volume":"74","author":"Budish Eric","year":"2010","unstructured":"Eric Budish. 2010. The combinatorial assignment problem: approximate competitive equilibrium from equal incomes, Moshe Dror and Greys Sosic (Eds.). ACM, 74:1.","journal-title":"ACM"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Ioannis Caragiannis Jugal Garg Nidhi Rathi Eklavya Sharma and Giovanna Varricchio. 2023. New Fairness Concepts for Allocating Indivisible Items. ijcai.org 2554\u20132562.","DOI":"10.24963\/ijcai.2023\/284"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355902"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/20"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3616009"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085125"},{"key":"e_1_3_2_1_22_1","unstructured":"Uriel Feige. 2025. The residual maximin share. arXiv:2505.19961 [cs.GT] https:\/\/arxiv.org\/abs\/2505.19961"},{"key":"e_1_3_2_1_23_1","volume-title":"An Improved Approximation Algorithm for Maximin Shares. In EC '20: The 21st ACM Conference on Economics and Computation. ACM, 379\u2013380","author":"Garg Jugal","year":"2020","unstructured":"Jugal Garg and Setareh Taki. 2020. An Improved Approximation Algorithm for Maximin Shares. In EC '20: The 21st ACM Conference on Economics and Computation. ACM, 379\u2013380."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219238"},{"key":"e_1_3_2_1_25_1","volume-title":"WINE (Lecture Notes in Computer Science","volume":"383","author":"Halpern Daniel","year":"2020","unstructured":"Daniel Halpern, Ariel D. Procaccia, Alexandros Psomas, and Nisarg Shah. 2020. Fair Division with Binary Valuations: One Rule to Rule Them All. In Web and Internet Economics - 16th International Conference, WINE (Lecture Notes in Computer Science, Vol. 12495). Springer, 370\u2013383."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10041"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3140756"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988792"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M124397X"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2410.13580"}],"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.3742613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:49:13Z","timestamp":1751482153000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3736252.3742613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"references-count":30,"alternative-id":["10.1145\/3736252.3742613","10.1145\/3736252"],"URL":"https:\/\/doi.org\/10.1145\/3736252.3742613","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"}}]}}