{"type":"ScholarlyArticle","title":"Individual Rationality in Topological Distance Games Is Surprisingly Hard","authors":[{"name":"Argyrios Deligkas","slug":"argyrios-deligkas","given":"Argyrios","family":"Deligkas","affiliation":"Royal Holloway , University of London"},{"name":"Eduard Eiben","slug":"eduard-eiben","given":"Eduard","family":"Eiben","affiliation":"Royal Holloway , University of London"},{"name":"Dušan Knop","slug":"dusan-knop","given":"Dušan","family":"Knop","affiliation":"Czech Technical University in Prague"},{"name":"Šimon Schierreich","slug":"simon-schierreich","given":"Šimon","family":"Schierreich","affiliation":"Czech Technical University in Prague"}],"abstract":"In the recently introduced topological distance games, strategic agents need to be assigned to a subset of vertices of a topology. In the assignment, the utility of an agent depends on both the agent's inherent utilities for other agents and its distance from them on the topology. We study the computational complexity of finding individually-rational outcomes; this notion is widely assumed to be the very minimal stability requirement and requires that the utility of every agent in a solution is non-negative.\r\nWe perform a comprehensive study of the problem's complexity, and we prove that even in very basic cases, deciding whether an individually-rational solution exists is intractable. To reach at least some tractability, one needs to combine multiple restrictions of the input instance, including the number of agents and the topology and the influence of distant agents on the utility.","doi":"10.24963/ijcai.2024/308","url":"https://ijcai.org/proceedings/2024/308","pdf":"https://ijcai.org/proceedings/2024/0308.pdf","markdown":"https://ijcai.org/proceedings/2024/308.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/308","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Game Theory and Economic Paradigms","track":"Main Track","number":308,"pages":{"first":2782,"last":2790},"keywords":["Game Theory and Economic Paradigms: GTEP: Computational social choice"],"videos":[],"references":[{"position":1,"raw":"[Agarwal et al., 2021] Aishwarya Agarwal, Edith Elkind, Jiarui Gan, Ayumi Igarashi, Warut Suksompong, and Alexandros A. Voudouris. Schelling games on graphs. Ar- tif. Intell., 301:103576, 2021.","title":"Schelling games on graphs","authors":"Agarwal","year":"2021","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Aziz and Savani, 2016] Haris Aziz and Rahul Savani. He- donic games. In Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel D. Procaccia, editors, Handbook of Computational Social Choice, pages 356- 376. Cambridge University Press, 2016.","title":"Hedonic games","authors":"Haris Aziz, Rahul Savani","year":"2016","venue":"Handbook of Computational Social Choice","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Aziz et al., 2013] Haris Aziz, Felix Brandt, and Hans Georg Seedig. Computing desirable partitions in additively sepa- rable hedonic games. Artif. Intell., 195:316-334, 2013.","title":"Computing desirable partitions in additively separable hedonic games","authors":"Haris Aziz, Felix Brandt, Hans Georg, Seedig","year":"2013","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Aziz et al., 2019] Haris Aziz, Florian Brandl, Felix Brandt, Paul Harrenstein, Martin Olsen, and Dominik Peters. Fractional hedonic games. ACM Trans. Econ. Comput., 7(2):6:1-6:29, 2019.","title":"Fractional hedonic games","authors":"Haris Aziz, Florian Brandl, Felix Brandt, Paul Harrenstein, Martin Olsen, Dominik Peters","year":"2019","venue":"ACM Trans. Econ. Comput","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Balliu et al., 2019] Alkida Balliu, Michele Flammini, Gio- vanna Melideo, and Dennis Olivetti. On non- cooperativeness in social distance games. J. Artif. Intell. Res., 66:625-653, 2019.","title":"On noncooperativeness in social distance games","authors":"Balliu","year":"2019","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Balliu et al., 2022] Alkida Balliu, Michele Flammini, Gio- vanna Melideo, and Dennis Olivetti. On Pareto optimality in social distance games. Artif. Intell., 312:103768, 2022.","title":"On Pareto optimality in social distance games","authors":"Balliu","year":"2022","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bilò et al., 2022a] Davide Bilò, Vittorio Bilò, Pascal Lenzner, and Louise Molitor. Tolerance is necessary for stability: Single-peaked swap Schelling games. In IJ- CAI '22, pages 81-87. ijcai.org, 2022.","title":"Tolerance is necessary for stability: Single-peaked swap Schelling games","authors":"Bilò","year":"2022","venue":"IJ-CAI '22","doi":null,"url":null,"internal_url":"/proceedings/2022/12"},{"position":8,"raw":"[Bilò et al., 2022b] Davide Bilò, Vittorio Bilò, Pascal Lenzner, and Louise Molitor. Topological influence and locality in swap Schelling games. Auton. Agents Multi Agent Syst., 36(2):47, 2022.","title":"Topological influence and locality in swap Schelling games","authors":"Bilò","year":"2022","venue":"Auton. Agents Multi Agent Syst","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bilò et al., 2022c] Vittorio Bilò, Gianpiero Monaco, and Luca Moscardelli. Hedonic games with fixed-size coali- tions. In AAAI '22, pages 9287-9295. AAAI Press, 2022.","title":"Hedonic games with fixed-size coalitions","authors":"Bilò","year":"2022","venue":"AAAI '22","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Bilò et al., 2023] Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, and Jonas Schmidt. Schelling games with continuous types. In IJ- CAI '23, pages 2520-2527. ijcai.org, 2023. Bodlaender et al., 2020]","title":"Schelling games with continuous types","authors":"Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt","year":"2020","venue":"IJ-CAI '23","doi":null,"url":null,"internal_url":"/proceedings/2023/280"},{"position":11,"raw":"Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, and Tom C. van der Zanden. Hedonic seat arrangement problems. In AAMAS '20, pages 1777-1779. IFAAMAS, 2020.","title":"Hedonic seat arrangement problems","authors":"L Hans, Tesshu Bodlaender, Lars Hanaka, Hirotaka Jaffke, Yota Ono, Tom C Otachi, Van Der Zanden","year":"2020","venue":"AAMAS '20","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"Anna Bogomolnaia and Matthew O. Jackson. The stability of hedonic coalition structures. Games Econ. Behav., 38(2):201-230, 2002.","title":"The stability of hedonic coalition structures","authors":"Anna Bogomolnaia, Matthew O Jackson","year":"2002","venue":"Games Econ. Behav","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Brânzei and Larson, 2011] Simina Brânzei and Kate Lar- son. Social distance games. In IJCAI '11, pages 91-96. IJCAI/AAAI, 2011.","title":"Simina Brânzei and Kate Larson. Social distance games","authors":"Larson Brânzei","year":"2011","venue":"IJCAI '11","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Bredereck et al., 2019] Robert Bredereck, Edith Elkind, and Ayumi Igarashi. Hedonic diversity games. In AA- MAS '19, pages 565-573. IFAAMAS, 2019.","title":"Hedonic diversity games","authors":"Robert Bredereck, Edith Elkind, Ayumi Igarashi","year":"2019","venue":"AA-MAS '19","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Bredereck et al., 2020] Robert Bredereck, Piotr Fal- iszewski, Andrzej Kaczmarczyk, Dušan Knop, and Rolf Niedermeier. Parameterized algorithms for finding a collective set of items. In AAAI '20, pages 1838-1845. AAAI Press, 2020.","title":"Parameterized algorithms for finding a collective set of items","authors":"Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dušan Knop, Rolf Niedermeier","year":"2020","venue":"AAAI '20","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Bullinger and Suksompong, 2024] Martin Bullinger and Warut Suksompong. Topological distance games. Theor. Comput. Sci., 981:114238, 2024.","title":"Topological distance games","authors":"Martin Bullinger, Warut Suksompong","year":"2024","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Ceylan et al., 2023] Esra Ceylan, Jiehua Chen, and San- jukta Roy. Optimal seat arrangement: What are the hard and easy cases? In IJCAI '23, pages 2563-2571. ijcai.org, 2023.","title":"Optimal seat arrangement: What are the hard and easy cases?","authors":"Esra Ceylan, Jiehua Chen, Sanjukta Roy","year":"2023","venue":"IJCAI '23","doi":null,"url":null,"internal_url":"/proceedings/2023/285"},{"position":18,"raw":"[Chauhan et al., 2018] Ankit Chauhan, Pascal Lenzner, and Louise Molitor. Schelling segregation with strategic agents. In SAGT '18, pages 137-149. Springer, 2018.","title":"Schelling segregation with strategic agents","authors":"Ankit Chauhan, Pascal Lenzner, Louise Molitor","year":"2018","venue":"SAGT '18","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Cygan et al., 2015] Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parame- terized Algorithms. Springer, 2015.","title":"Parameterized Algorithms","authors":"Marek Cygan, V Fedor, Lukasz Fomin, Daniel Kowalik, Dániel Lokshtanov, Marcin Marx, Michal Pilipczuk, Saket Pilipczuk, Saurabh","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Darmann, 2023] Andreas Darmann. Stability and welfare in (dichotomous) hedonic diversity games. Theory Comput. Syst., 67(6):1133-1155, 2023.","title":"Stability and welfare in (dichotomous) hedonic diversity games","authors":"Andreas Darmann","year":"2023","venue":"Theory Comput. Syst","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Deligkas et al., 2021] Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, and Sebastian Ordyniak. The parameterized complexity of connected fair division. In IJCAI '21, pages 139-145. ijcai.org, 2021.","title":"The parameterized complexity of connected fair division","authors":"Deligkas","year":"2021","venue":"IJCAI '21","doi":null,"url":null,"internal_url":"/proceedings/2021/20"},{"position":22,"raw":"[Deligkas et al., 2024a] Argyrios Deligkas, Eduard Eiben, and Tiger-Lily Goldsmith. The parameterized complex- ity of welfare guarantees in Schelling segregation. In AA- MAS '24, pages 425-433, Richland, SC, 2024. IFAAMAS.","title":"Tiger-Lily Goldsmith. The parameterized complexity of welfare guarantees in Schelling segregation","authors":"Deligkas","year":"2024","venue":"Argyrios Deligkas","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Deligkas et al., 2024b] Argyrios Deligkas, Eduard Eiben, Dušan Knop, and Šimon Schierreich. Individual ratio- nality in topological distance games is surprisingly hard. CoRR, abs/2404.14128, 2024.","title":"Individual rationality in topological distance games is surprisingly hard","authors":"Deligkas","year":"2024","venue":null,"doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Deligkas et al., 2024c] Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, and Šimon Schierreich. The com- plexity of fair division of indivisible items with external- ities. In AAAI '24, volume 38, part 9, pages 9653-9661. AAAI Press, 2024.","title":"Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, and Šimon Schierreich. The complexity of fair division of indivisible items with externalities","authors":"Deligkas","year":"2024","venue":"AAAI '24","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Diestel, 2017] Reinhard Diestel. Graph Theory, volume 173 of Graduate Texts in Mathematics. Springer, 5th edi- tion, 2017.","title":"Graph Theory","authors":"Reinhard Diestel","year":"2017","venue":"Graduate Texts in Mathematics","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Downey and Fellows, 1995] Rod G. Downey and Michael R. Fellows. Fixed-parameter tractability and completeness II: On completeness for W[1]. Theor. Comput. Sci., 141(1):109-131, 1995.","title":"Fixed-parameter tractability and completeness II: On completeness for W[1","authors":"Rod G Downey, Michael R Fellows","year":"1995","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Downey and Fellows, 2013] Rodney G. Downey and Michael R. Fellows. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, 2013.","title":"Fundamentals of Parameterized Complexity","authors":"Rodney G Downey, Michael R Fellows","year":"2013","venue":"Texts in Computer Science","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Drèze and Greenberg, 1980] J. H. Drèze and J. Greenberg. Hedonic coalitions: Optimality and stability. Economet- rica, 48(4):987-1003, 1980.","title":"Hedonic coalitions: Optimality and stability","authors":"J H Drèze, J Greenberg","year":"1980","venue":"Econometrica","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Echzell et al., 2019] Hagen Echzell, Tobias Friedrich, Pas- cal Lenzner, Louise Molitor, Marcus Pappik, Friedrich Schöne, Fabian Sommer, and David Stangl. Conver- gence and hardness of strategic Schelling segregation. In WINE '19, pages 156-170. Springer, 2019.","title":"Convergence and hardness of strategic Schelling segregation","authors":"Echzell","year":"2019","venue":"WINE '19","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Eiben et al., 2019] Eduard Eiben, Dušan Knop, Fahad Panolan, and Ondřej Suchý. Complexity of the Steiner network problem with respect to the number of terminals. In STACS '19, pages 25:1-25:17, 2019.","title":"Complexity of the Steiner network problem with respect to the number of terminals","authors":"Eiben","year":"2019","venue":"STACS '19","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Fanelli et al., 2021] Angelo Fanelli, Gianpiero Monaco, and Luca Moscardelli. Relaxed core stability in fractional he- donic games. In IJCAI '21, pages 182-188. ijcai.org, 2021.","title":"Relaxed core stability in fractional hedonic games","authors":"Angelo Fanelli, Gianpiero Monaco, Luca Moscardelli","year":"2021","venue":"IJCAI '21","doi":null,"url":null,"internal_url":"/proceedings/2021/26"},{"position":32,"raw":"[Flammini et al., 2020] Michele Flammini, Bojana Kodric, Martin Olsen, and Giovanna Varricchio. Distance hedo- nic games. In AAMAS '20, pages 1846-1848. IFAAMAS, 2020.","title":"Distance hedonic games","authors":"Michele Flammini, Bojana Kodric, Martin Olsen, Giovanna Varricchio","year":"2020","venue":"AAMAS '20","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Friedrich et al., 2023] Tobias Friedrich, Pascal Lenzner, Louise Molitor, and Lars Seifert. Single-peaked jump Schelling games. In AAMAS '23, pages 2899-2901.","title":"Single-peaked jump Schelling games","authors":"Friedrich","year":"2023","venue":"AAMAS '23","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"IFAAMAS, 2023.","title":null,"authors":"Ifaamas","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Ganian et al., 2023a] Robert Ganian, Thekla Hamm, Dušan Knop, Sanjukta Roy, Šimon Schierreich, and Ondřej Suchý. Maximizing social welfare in score-based social distance games. In TARK '23, pages 272-286, 2023.","title":"Maximizing social welfare in score-based social distance games","authors":"Ganian","year":"2023","venue":"TARK '23","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Ganian et al., 2023b] Robert Ganian, Thekla Hamm, Dušan Knop, Šimon Schierreich, and Ondřej Suchý. Hedonic di- versity games: A complexity picture with more than two colors. Artif. Intell., 325:104017, 2023.","title":"Hedonic diversity games: A complexity picture with more than two colors","authors":"Ganian","year":"2023","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Ganian et al., 2023c] Robert Ganian, Sebastian Ordyniak, and C. S. Rahul. Group activity selection with few agent types. Algorithmica, 85(5):1111-1155, 2023.","title":"Group activity selection with few agent types","authors":"Ganian","year":"2023","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Garey and Johnson, 1979] Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979. [Hanaka and Lampis, 2022] Tesshu Hanaka and Michael Lampis. Hedonic games and treewidth revisited. In ESA '22, pages 64:1-64:16, 2022.","title":"Tesshu Hanaka and Michael Lampis. Hedonic games and treewidth revisited","authors":"Michael R Garey, David S Johnson, W H Freeman","year":"1979","venue":"Hanaka and Lampis","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Kaklamanis et al., 2018] Christos Kaklamanis, Panagiotis Kanellopoulos, and Dimitris Patouchas. On the price of stability of social distance games. In SAGT '18, pages 125-136. Springer, 2018.","title":"On the price of stability of social distance games","authors":"Christos Kaklamanis, Panagiotis Kanellopoulos, Dimitris Patouchas","year":"2018","venue":"SAGT '18","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Knop and Schierreich, 2023] Dušan Knop and Šimon Schierreich. Host community respecting refugee housing. In AAMAS '23, pages 966-975. IFAAMAS, 2023.","title":"Dušan Knop and Šimon Schierreich. Host community respecting refugee housing","authors":"Schierreich Knop","year":"2023","venue":"AAMAS '23","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Kreisel et al., 2022] Luca Kreisel, Niclas Boehmer, Vincent Froese, and Rolf Niedermeier. Equilibria in Schelling games: Computational hardness and robustness. In AA- MAS '22, pages 761-769. IFAAMAS, 2022.","title":"Equilibria in Schelling games: Computational hardness and robustness","authors":"Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier","year":"2022","venue":"AA-MAS '22","doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Li et al., 2023] Lily Li, Evi Micha, Aleksandar Nikolov, and Nisarg Shah. Partitioning friends fairly. In AAAI '23, pages 5747-5754. AAAI Press, 2023.","title":"Partitioning friends fairly","authors":"Li","year":"2023","venue":"AAAI '23","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Lisowski and Schierreich, 2023] Grzegorz Lisowski and Šimon Schierreich. Swap stability in refugee housing: A story about anonymous preferences. In STAIRS '23, 2023.","title":"Swap stability in refugee housing: A story about anonymous preferences","authors":"Grzegorz Lisowski, Šimon Schierreich","year":"2023","venue":"STAIRS '23","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Marx, 2010] Dániel Marx. Can you beat treewidth? Theory Comput., 6(1):85-112, 2010.","title":"Can you beat treewidth?","authors":"Dániel Marx","year":"2010","venue":"Theory Comput","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Niedermeier, 2006] Rolf Niedermeier. Invitation to Fixed- Parameter Algorithms, volume 31 of Oxford Lecture Se- ries in Mathematics and its Applications. Oxford Univer- sity Press, 2006.","title":"Invitation to Fixed-Parameter Algorithms","authors":"Rolf Niedermeier","year":"2006","venue":"Oxford Lecture Series in Mathematics and its Applications","doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Peters, 2016] Dominik Peters. Graphical hedonic games of bounded treewidth. In AAAI '16, pages 586-593. AAAI Press, 2016.","title":"Graphical hedonic games of bounded treewidth","authors":"Dominik Peters","year":"2016","venue":"AAAI '16","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Schelling, 1969] Thomas C. Schelling. Models of segrega- tion. Am. Econ. Rev., 59(2):488-493, 1969.","title":"Models of segregation","authors":"C Thomas, Schelling","year":"1969","venue":"Am. Econ. Rev","doi":null,"url":null,"internal_url":null},{"position":48,"raw":"[Schelling, 1971] Thomas C. Schelling. Dynamic models of segregation. J. Math. Sociol., 1(2):143-186, 1971.","title":"Dynamic models of segregation","authors":"C Thomas, Schelling","year":"1971","venue":"J. Math. Sociol","doi":null,"url":null,"internal_url":null},{"position":49,"raw":"[Schierreich, 2023] Šimon Schierreich. Anonymous refugee housing with upper-bounds. CoRR, abs/2308.09501, 2023.","title":"Šimon Schierreich. Anonymous refugee housing with upper-bounds","authors":"Schierreich","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":50,"raw":"[Wilczynski, 2023] Anaëlle Wilczynski. Ordinal hedonic seat arrangement under restricted preference domains: Swap stability and popularity. In IJCAI '23, pages 2906- 2914. ijcai.org, 2023.","title":"Ordinal hedonic seat arrangement under restricted preference domains: Swap stability and popularity","authors":"Anaëlle Wilczynski, Wilczynski","year":"2023","venue":"IJCAI '23","doi":null,"url":null,"internal_url":"/proceedings/2023/324"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}