{"type":"ScholarlyArticle","title":"Approximating Fair Division on D-Claw-Free Graphs","authors":[{"name":"Zbigniew Lonc","slug":"zbigniew-lonc","given":"Zbigniew","family":"Lonc","affiliation":"Warsaw University of Technology , Poland"}],"abstract":"We study the problem of fair allocation of indivisible goods that form a graph and the bundles that are distributed to agents are connected subgraphs of this graph. We focus on the maximin share and the proportional fairness criteria. It is well-known that allocations satisfying these criteria may not exist for many graphs including complete graphs and cycles. Therefore, it is natural to look for approximate allocations, i.e., allocations guaranteeing each agent a certain portion of the value that is satisfactory to her. In this paper we consider the class of graphs of goods which do not contain a star with d+1 edges (where d > 1) as an induced subgraph. For this class of graphs we prove that there is an allocation assigning each agent a connected bundle of value at least 1/d of her maximin share. Moreover, for the same class of graphs of goods, we show a theorem which specifies what fraction of the proportional share can be guaranteed to each agent if the values of single goods for the agents are bounded by a given fraction of this share.","doi":"10.24963/ijcai.2023/315","url":"https://ijcai.org/proceedings/2023/315","pdf":"https://ijcai.org/proceedings/2023/0315.pdf","markdown":"https://ijcai.org/proceedings/2023/315.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/315","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Game Theory and Economic Paradigms","track":"Main Track","number":315,"pages":{"first":2826,"last":2834},"keywords":["Agent-based and Multi-agent Systems: MAS: Resource allocation","Game Theory and Economic Paradigms: GTEP: Fair division"],"videos":[],"references":[{"position":1,"raw":"[Amanatidis et al., 2017] Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, and Amin Saberi. Approxima- tion algorithms for computing maximin share allocations. ACM Transactions on Algoritms (TALG), 13(4):52:1- 52:28, 2017.","title":"Approximation algorithms for computing maximin share allocations","authors":"Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi","year":"2017","venue":"ACM Transactions on Algoritms (TALG)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Amanatidis et al., 2022] Georgios Amanatidis, Geor- gios Birmpas, Aris Filos-Ratsikas, and Alexandros A. Voudouris. Fair division of indivisible goods: A survey. In Luc De Raedt, editor, Proceedings of the 31th Interna- tional Joint Conference on Artificial Intelligence, IJCAI 2022, pages 5385-5393. ijcai.org, 2022.","title":"Fair division of indivisible goods: A survey","authors":"Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A Voudouris","year":"2022","venue":"Proceedings of the 31th International Joint Conference on Artificial Intelligence, IJCAI 2022","doi":null,"url":null,"internal_url":"/proceedings/2022/756"},{"position":3,"raw":"[Barman and Murthy, 2017] Siddharth Barman and Sanath Kumar Krishna Murthy. Approximation algorithms for maximin fair division. In Proceedings of the 2017 ACM Conference on Economics and Computation, pages 647- 664. ACM, 2017.","title":"Approximation algorithms for maximin fair division","authors":"Siddharth Barman, Sanath Kumar, Krishna Murthy","year":"2017","venue":"Proceedings of the 2017 ACM Conference on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bei et al., 2022] Xiaohui Bei, Ayumi Igarashi, Xinhang Lu, and Warut Suksompong. The price of connectivity in fair division. SIAM Journal on Discrete Mathematics, 36(2):1156-1186, 2022.","title":"The price of connectivity in fair division","authors":"Xiaohui Bei, Ayumi Igarashi, Xinhang Lu, Warut Suksompong","year":"2022","venue":"SIAM Journal on Discrete Mathematics","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bilò et al., 2022] Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, and William S. Zwicker. Almost envy-free allocations with connected bundles. Games and Economic Behavior, 131:197-221, 2022.","title":"Almost envy-free allocations with connected bundles","authors":"Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S Zwicker","year":"2022","venue":"Games and Economic Behavior","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bondy and Murty, 2008] J.A. Bondy and U.S.R. Murty. Graph Theory. Springer, 2008.","title":"Graph Theory","authors":"J A Bondy, U S R Murty","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bouveret and Lemaître, 2016] Sylvain Bouveret and Michel Lemaître. Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Autonomous Agents and Multi-Agent Systems, 30(2):259-290, 2016.","title":"Characterizing conflicts in fair division of indivisible goods using a scale of criteria","authors":"Lemaître Bouveret, Sylvain Bouveret, Michel Lemaître","year":"2016","venue":"Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bouveret et al., 2016] Sylvain Bouveret, Yann Chevaleyre, and Nicolas Maudet. Fair allocation of indivisible goods. In Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel D. Procaccia, editors, Handbook of Com- putational Social Choice, pages 284-310. Cambridge Uni- versity Press, 2016.","title":"Fair allocation of indivisible goods","authors":"Sylvain Bouveret, Yann Chevaleyre, Nicolas Maudet","year":"2016","venue":"Handbook of Computational Social Choice","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bouveret et al., 2017] Sylvain Bouveret, Katarína Cechlárová, Edith Elkind, Ayumi Igarashi, and Do- minik Peters. Fair division of a graph. In Carles Sierra, editor, Proceedings of the 26th International Joint Con- ference on Artificial Intelligence, IJCAI 2017, pages 135-141. ijcai.org, 2017.","title":"Fair division of a graph","authors":"Sylvain Bouveret, Katarína Cechlárová, Edith Elkind, Ayumi Igarashi, Dominik Peters","year":"2017","venue":"Proceedings of the 26th International Joint Conference on Artificial Intelligence, IJCAI 2017","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Bouveret et al., 2019] Sylvain Bouveret, Katarína Cechlárová, and Julien Lesca. Chore division on a graph. Autonomous Agents and Multi-Agent Systems, 33(5):540-563, 2019.","title":"Chore division on a graph","authors":"Sylvain Bouveret, Katarína Cechlárová, Julien Lesca","year":"2019","venue":"Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Brams and Taylor, 1996] Steven J. Brams and Alan D. Tay- lor. Fair Division: From Cake-Cutting to Dispute Resolu- tion. Cambridge University Press, 1996.","title":"Fair Division: From Cake-Cutting to Dispute Resolution","authors":"Steven J Brams, Alan D Taylor","year":"1996","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Budish, 2011] Eric Budish. The combinatorial assign- ment problem: Approximate competitive equilibrium from equal incomes. Journal of Political Economy, 119(6):1061-1103, 2011.","title":"The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes","authors":"Eric Budish","year":"2011","venue":"Journal of Political Economy","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Chudnovsky and Seymour, 2010] M. Chudnovsky and P. Seymour. The structure of claw-free graphs. In Webb Bridget S., editor, Surveys in Combinatorics, pages 153-172. Cambridge University Press, 2010.","title":"The structure of claw-free graphs","authors":"M Chudnovsky, P Seymour","year":"2010","venue":"Surveys in Combinatorics","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Deligkas et al., 2021] Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, and Sebastian Ordyniak. The parameterized complexity of connected fair division. In Zhi-Hua Zhou, editor, Proceedings of the 30th Inter- national Joint Conference on Artificial Intelligence, IJCAI 2021, pages 139-145. ijcai.org, 2021.","title":"The parameterized complexity of connected fair division","authors":"Deligkas","year":"2021","venue":"Proceedings of the 30th International Joint Conference on Artificial Intelligence, IJCAI 2021","doi":null,"url":null,"internal_url":"/proceedings/2021/20"},{"position":15,"raw":"[Faudree et al., 1997] Ralph Faudree, Evelyne Flandrin, and Zdeněk Ryjáček. Claw-free graphs -a survey. Discrete Mathematics, 164(1-3):87-147, 1997.","title":"Claw-free graphs -a survey","authors":"Faudree","year":"1997","venue":"Discrete Mathematics","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Garg and Taki, 2021] Jugal Garg and Setareh Taki. An im- proved approximation algorithm for maximin shares. Ar- tificial Intelligence, 300(103547), 2021.","title":"An improved approximation algorithm for maximin shares","authors":"Taki Garg, Jugal Garg, Setareh Taki","year":"2021","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Garg et al., 2019] Jugal Garg, Peter McGlaughlin, and Setareh Taki. Approximating maximin share allocations. In Proceedings of the 2nd Symposium on Simplicity in Al- gorithms (SOSA), volume 69, pages 20:1-20:11. Schloss Dagstuhl -Leibniz-Zentrum fur Informatik, 2019.","title":"Approximating maximin share allocations","authors":"Jugal Garg, Peter Mcglaughlin, Setareh Taki","year":"2019","venue":"Proceedings of the 2nd Symposium on Simplicity in Algorithms (SOSA)","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Ghodsi et al., 2018] Mohammad Ghodsi, Mohammadtaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, and Hadi Yami. Fair allocation of indivisible goods: Improve- ments and generalizations. In Proceedings of the 2018 ACM Conference on Economics and Computation, EC- 2018, pages 539-556, New York, NY, USA, 2018. ACM.","title":"Fair allocation of indivisible goods: Improvements and generalizations","authors":"Mohammad Ghodsi, Mohammadtaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami","year":"2018","venue":"Proceedings of the 2018 ACM Conference on Economics and Computation, EC-2018","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Greco and Scarcello, 2020] Gianluigi Greco and Francesco Scarcello. The complexity of computing maximin share allocations on graphs. In The 34th AAAI Conference on Ar- tificial Intelligence, AAAI 2020, pages 2006-2013. AAAI Press, 2020.","title":"The complexity of computing maximin share allocations on graphs","authors":"Gianluigi Greco, Francesco Scarcello","year":"2020","venue":"The 34th AAAI Conference on Artificial Intelligence, AAAI 2020","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Igarashi and Peters, 2019] Ayumi Igarashi and Dominik Pe- ters. Pareto-optimal allocation of indivisible goods with connectivity constraints. In The 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, pages 2045-2052. AAAI Press, 2019.","title":"Ayumi Igarashi and Dominik Peters. Pareto-optimal allocation of indivisible goods with connectivity constraints","authors":"Peters Igarashi","year":"2019","venue":"The 33rd AAAI Conference on Artificial Intelligence, AAAI 2019","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[King and Burton, 1982] Russell King and Steve Burton. Land fragmentation: Notes on a fundamental rural spa- tial problem. Progress in Human Geography, 6(4):475- 94, 1982.","title":"Russell King and Steve Burton. Land fragmentation: Notes on a fundamental rural spatial problem","authors":"Burton King","year":"1982","venue":"Progress in Human Geography","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Kurokawa et al., 2016] David Kurokawa, Ariel D. Procac- cia, and Junxing Wang. When can the maximin share guar- antee be guaranteed? In Dale Schuurmans and Michael P. Wellman, editors, Proceedings of the 30th AAAI Confer- ence on Artificial Intelligence, pages 523-529, 2016.","title":"When can the maximin share guarantee be guaranteed?","authors":"David Kurokawa, Ariel D Procaccia, Junxing Wang","year":"2016","venue":"Proceedings of the 30th AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Lempel et al., 1967] A. Lempel, S. Even, and I. Ceder- baum. An algorithm for planarity testing of graphs. In P. Rosenstiehl, editor, Theory of Graphs: Interna- tional Symposium, July 1966, pages 215-232.","title":"An algorithm for planarity testing of graphs","authors":"A Lempel, S Even, I Cederbaum","year":"1966","venue":"Theory of Graphs: International Symposium","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"Gordon and Breach, 1967.","title":null,"authors":"Breach Gordon","year":"1967","venue":null,"doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Lonc and Truszczynski, 2020] Zbigniew Lonc and Miroslaw Truszczynski. Maximin Share Allocations on Cycles. Journal of Artificial Intelligence Research, 69:613-655, 2020.","title":"Maximin Share Allocations on Cycles","authors":"Zbigniew Lonc, Miroslaw Truszczynski","year":"2020","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":"/proceedings/2018/57"},{"position":26,"raw":"[Procaccia and Wang, 2014] Ariel D. Procaccia and Junxing Wang. Fair enough: guaranteeing approximate maximin shares. In Moshe Babaioff, Vincent Conitzer, and David Easley, editors, Proceedings of the ACM Conference on Economics and Computation, EC-2014, pages 675-692. ACM, 2014.","title":"Fair enough: guaranteeing approximate maximin shares","authors":"Ariel D Procaccia, Junxing Wang","year":"2014","venue":"Proceedings of the ACM Conference on Economics and Computation, EC-2014","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Procaccia, 2016] Ariel Procaccia. Cake-cutting algorithms. In Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel D. Procaccia, editors, Handbook of Com- putational Social Choice, pages 311-329. Cambridge Uni- versity Press, 2016.","title":"Cake-cutting algorithms","authors":"Ariel Procaccia","year":"2016","venue":"Handbook of Computational Social Choice","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Suksompong, 2019] Warut Suksompong. Fairly allocating contiguous blocks of indivisible items. Discrete Applied Mathematics, 260:227-236, 2019.","title":"Warut Suksompong. Fairly allocating contiguous blocks of indivisible items","authors":"Suksompong","year":"2019","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Suksompong, 2021] Warut Suksompong. Constraints in fair division. ACM SIGecom Exchanges, 19(2):46-61, 2021.","title":"Warut Suksompong. Constraints in fair division","authors":"Suksompong","year":"2021","venue":"ACM SIGecom Exchanges","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Truszczynski, 2021] Miroslaw Truszczynski. Private com- munication. 2021.","title":"Private communication","authors":"Miroslaw Truszczynski","year":"2021","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}