{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T06:57:27Z","timestamp":1764053847117,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T00:00:00Z","timestamp":1688688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,9]]},"DOI":"10.1145\/3580507.3597675","type":"proceedings-article","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T14:19:22Z","timestamp":1688739562000},"page":"1129-1152","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["A General Framework for Fair Allocation under Matroid Rank Valuations"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6261-6228","authenticated-orcid":false,"given":"Vignesh","family":"Viswanathan","sequence":"first","affiliation":[{"name":"University of Massachusetts, Amherst, Amherst, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0635-6230","authenticated-orcid":false,"given":"Yair","family":"Zick","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst, Amherst, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI). 46--52","author":"Aziz Haris","year":"2019","unstructured":"Haris Aziz , Hau Chan , and Bo Li . 2019 . Weighted Maxmin Fair Share Allocation of Indivisible Chores . In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI). 46--52 . Haris Aziz, Hau Chan, and Bo Li. 2019. Weighted Maxmin Fair Share Allocation of Indivisible Chores. In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI). 46--52."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2020.07.005"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i6.16647"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467559"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538286"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 20th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). 169--177","author":"Barman Siddharth","year":"2021","unstructured":"Siddharth Barman and Paritosh Verma . 2021 . Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations . In Proceedings of the 20th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). 169--177 . Siddharth Barman and Paritosh Verma. 2021. Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations. In Proceedings of the 20th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). 169--177."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i5.20407"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/14"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485006"},{"volume-title":"Handbook of Computational Social Choice, Felix Brandt, Vincent Conitzer, Ulle Endriss, J\u00e9r\u00f4me Lang, and Ariel D","author":"Bouveret Sylvain","key":"e_1_3_2_1_10_1","unstructured":"Sylvain Bouveret , Yann Chevaleyre , and Nicolas Maudet . 2016. Fair Allocation of Indivisible Goods . In Handbook of Computational Social Choice, Felix Brandt, Vincent Conitzer, Ulle Endriss, J\u00e9r\u00f4me Lang, and Ariel D . Procaccia (Eds.). Cambridge University Press , Chapter 12. Sylvain Bouveret, Yann Chevaleyre, and Nicolas Maudet. 2016. Fair Allocation of Indivisible Goods. In Handbook of Computational Social Choice, Felix Brandt, Vincent Conitzer, Ulle Endriss, J\u00e9r\u00f4me Lang, and Ariel D. Procaccia (Eds.). Cambridge University Press, Chapter 12."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1086\/664613"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940726"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00072"},{"key":"e_1_3_2_1_14_1","volume-title":"Weighted Envy-Freeness in Indivisible Item Allocation. ACM Transactions on Economics and Computation 9","author":"Chakraborty Mithun","year":"2021","unstructured":"Mithun Chakraborty , Ayumi Igarashi , Warut Suksompong , and Yair Zick . 2021a. Weighted Envy-Freeness in Indivisible Item Allocation. ACM Transactions on Economics and Computation 9 ( 2021 ). Mithun Chakraborty, Ayumi Igarashi, Warut Suksompong, and Yair Zick. 2021a. Weighted Envy-Freeness in Indivisible Item Allocation. ACM Transactions on Economics and Computation 9 (2021)."},{"key":"e_1_3_2_1_15_1","volume-title":"Picking sequences and monotonicity in weighted fair division. Artificial Intelligence 301","author":"Chakraborty Mithun","year":"2021","unstructured":"Mithun Chakraborty , Ulrike Schmidt-Kraepelin , and Warut Suksompong . 2021b. Picking sequences and monotonicity in weighted fair division. Artificial Intelligence 301 ( 2021 ). Mithun Chakraborty, Ulrike Schmidt-Kraepelin, and Warut Suksompong. 2021b. Picking sequences and monotonicity in weighted fair division. Artificial Intelligence 301 (2021)."},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI)","author":"Chakraborty Mithun","year":"2022","unstructured":"Mithun Chakraborty , Erel Segal-Halevi , and Warut Suksompong . 2022 . Weighted Fairness Notions for Indivisible Items Revisited . Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI) (2022), 4949--4956. Mithun Chakraborty, Erel Segal-Halevi, and Warut Suksompong. 2022. Weighted Fairness Notions for Indivisible Items Revisited. Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI) (2022), 4949--4956."},{"key":"e_1_3_2_1_17_1","volume-title":"Fair Allocation of Indivisible Items with Conflict Graphs. Algorithmica","author":"Chiarelli Nina","year":"2022","unstructured":"Nina Chiarelli , Matja\u017e Krnc , Martin Milani\u010d , Ulrich Pferschy , Nevena Piva\u010d , and Joachim Schauer . 2022. Fair Allocation of Indivisible Items with Conflict Graphs. Algorithmica ( 2022 ). Nina Chiarelli, Matja\u017e Krnc, Martin Milani\u010d, Ulrich Pferschy, Nevena Piva\u010d, and Joachim Schauer. 2022. Fair Allocation of Indivisible Items with Conflict Graphs. Algorithmica (2022)."},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the 35th Annual Conference on Neural Information Processing Systems (NeurIPS). 16610--16621","author":"Cousins Cyrus","year":"2021","unstructured":"Cyrus Cousins . 2021 a. An Axiomatic Theory of Provably-Fair Welfare-Centric Machine Learning . In Proceedings of the 35th Annual Conference on Neural Information Processing Systems (NeurIPS). 16610--16621 . Cyrus Cousins. 2021a. An Axiomatic Theory of Provably-Fair Welfare-Centric Machine Learning. In Proceedings of the 35th Annual Conference on Neural Information Processing Systems (NeurIPS). 16610--16621."},{"volume-title":"Bounds and Applications of Concentration of Measure in Fair Machine Learning and Data Science. Ph. D. Dissertation","author":"Cousins Cyrus","key":"e_1_3_2_1_19_1","unstructured":"Cyrus Cousins . 2021b. Bounds and Applications of Concentration of Measure in Fair Machine Learning and Data Science. Ph. D. Dissertation . Brown University . Cyrus Cousins. 2021b. Bounds and Applications of Concentration of Measure in Fair Machine Learning and Data Science. Ph. D. Dissertation. Brown University."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11291"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2112.10199"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219238"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64946-3_26"},{"key":"e_1_3_2_1_24_1","unstructured":"Hoda Heidari Claudio Ferrari Krishna Gummadi and Andreas Krause. 2018. Fairness behind a veil of ignorance: A welfare analysis for automated decision making. In Advances in Neural Information Processing Systems. 1265--1276.  Hoda Heidari Claudio Ferrari Krishna Gummadi and Andreas Krause. 2018. Fairness behind a veil of ignorance: A welfare analysis for automated decision making. In Advances in Neural Information Processing Systems. 1265--1276."},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of the ACM Web Conference","author":"Li Bo","year":"2022","unstructured":"Bo Li , Yingkai Li , and Xiaowei Wu . 2022 . Almost (Weighted) Proportional Allocations for Indivisible Chores . In Proceedings of the ACM Web Conference 2022. 122--131. Bo Li, Yingkai Li, and Xiaowei Wu. 2022. Almost (Weighted) Proportional Allocations for Indivisible Chores. In Proceedings of the ACM Web Conference 2022. 122--131."},{"volume-title":"Proceedings of the 5th ACM Conference on Economics and Computation (EC). 125--131","author":"Lipton R. J.","key":"e_1_3_2_1_26_1","unstructured":"R. J. Lipton , E. Markakis , E. Mossel , and A. Saberi . 2004. On Approximately Fair Allocations of Indivisible Goods . In Proceedings of the 5th ACM Conference on Economics and Computation (EC). 125--131 . R. J. Lipton, E. Markakis, E. Mossel, and A. Saberi. 2004. On Approximately Fair Allocations of Indivisible Goods. In Proceedings of the 5th ACM Conference on Economics and Computation (EC). 125--131."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2209.06437"},{"volume-title":"Fair division and collective welfare","author":"Moulin Herv\u00e9","key":"e_1_3_2_1_28_1","unstructured":"Herv\u00e9 Moulin . 2004. Fair division and collective welfare . MIT Press . Herv\u00e9 Moulin. 2004. Fair division and collective welfare. MIT Press."},{"key":"e_1_3_2_1_29_1","volume-title":"Almost Envy-Freeness with General Valuations. ArXiv abs\/1707.04769","author":"Plaut Benjamin","year":"2017","unstructured":"Benjamin Plaut and Tim Roughgarden . 2017. Almost Envy-Freeness with General Valuations. ArXiv abs\/1707.04769 ( 2017 ). Benjamin Plaut and Tim Roughgarden. 2017. Almost Envy-Freeness with General Valuations. ArXiv abs\/1707.04769 (2017)."},{"volume-title":"Proceedings of the 15th ACM Conference on Economics and Computation (EC). 675--692","author":"Ariel","key":"e_1_3_2_1_30_1","unstructured":"Ariel D. Procaccia and Junxing Wang. 2014. Fair Enough: Guaranteeing Approximate Maximin Shares . In Proceedings of the 15th ACM Conference on Economics and Computation (EC). 675--692 . Ariel D. Procaccia and Junxing Wang. 2014. Fair Enough: Guaranteeing Approximate Maximin Shares. In Proceedings of the 15th ACM Conference on Economics and Computation (EC). 675--692."},{"volume-title":"Combinatorial Optimization - Polyhedra and Efficiency","author":"Schrijver A.","key":"e_1_3_2_1_31_1","unstructured":"A. Schrijver . 2003. Combinatorial Optimization - Polyhedra and Efficiency . Springer . A. Schrijver. 2003. Combinatorial Optimization - Polyhedra and Efficiency. Springer."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.mathsocsci.2022.03.004"},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings of the 22nd International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS).","author":"Viswanathan Vignesh","year":"2023","unstructured":"Vignesh Viswanathan and Yair Zick . 2023 . Yankee Swap: a Fast and Simple Fair Allocation Mechanism for Matroid Rank Valuations . In Proceedings of the 22nd International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). Vignesh Viswanathan and Yair Zick. 2023. Yankee Swap: a Fast and Simple Fair Allocation Mechanism for Matroid Rank Valuations. In Proceedings of the 22nd International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS)."}],"event":{"name":"EC '23: 24th ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"London United Kingdom","acronym":"EC '23"},"container-title":["Proceedings of the 24th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597675","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580507.3597675","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:42Z","timestamp":1750178262000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597675"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,7]]},"references-count":33,"alternative-id":["10.1145\/3580507.3597675","10.1145\/3580507"],"URL":"https:\/\/doi.org\/10.1145\/3580507.3597675","relation":{},"subject":[],"published":{"date-parts":[[2023,7,7]]},"assertion":[{"value":"2023-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}