Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
89 tokens/sec
Gemini 2.5 Pro Premium
50 tokens/sec
GPT-5 Medium
29 tokens/sec
GPT-5 High Premium
28 tokens/sec
GPT-4o
90 tokens/sec
DeepSeek R1 via Azure Premium
55 tokens/sec
GPT OSS 120B via Groq Premium
468 tokens/sec
Kimi K2 via Groq Premium
207 tokens/sec
2000 character limit reached

Individual Rationality in Topological Distance Games is Surprisingly Hard (2404.14128v1)

Published 22 Apr 2024 in cs.GT and cs.DS

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. We 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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (64)
  1. Schelling games on graphs. Artificial Intelligence, 301:103576, 2021.
  2. Fractional hedonic games. ACM Transactions on Economics and Computation, 7(2):6:1–6:29, 2019.
  3. Computing desirable partitions in additively separable hedonic games. Artificial Intelligence, 195:316–334, 2013.
  4. Hedonic 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.
  5. On non-cooperativeness in social distance games. Journal of Artificial Intelligence Research, 66:625–653, 2019.
  6. On Pareto optimality in social distance games. Artificial Intelligence, 312:103768, 2022.
  7. Deciding twin-width at most 4 is NP-complete. In Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, ICALP ’22, pages 18:1–18:20, 2022.
  8. Schelling games with continuous types. In Proceedings of the 32nd International Joint Conference on Artificial Intelligence, IJCAI ’23, pages 2520–2527. ijcai.org, 2023.
  9. Tolerance is necessary for stability: Single-peaked swap Schelling games. In Proceedings of the 31st International Joint Conference on Artificial Intelligence, IJCAI ’22, pages 81–87. ijcai.org, 2022.
  10. Topological influence and locality in swap Schelling games. Autonomous Agents and Multi-Agent Systems, 36(2):47, 2022.
  11. Hedonic games with fixed-size coalitions. In Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI ’22, pages 9287–9295. AAAI Press, 2022.
  12. Hedonic seat arrangement problems. In Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS ’20, pages 1777–1779. IFAAMAS, 2020.
  13. The stability of hedonic coalition structures. Games and Economic Behavior, 38(2):201–230, 2002.
  14. Twin-width can be exponential in treewidth. Journal of Combinatorial Theory, Series B, 161:1–14, 2023.
  15. Twin-width III: Max independent set, min dominating set, and coloring. In Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, ICALP ’21, pages 35:1–35:20, 2021.
  16. Twin-width I: Tractable FO model checking. Journal of the ACM, 69(1):3:1–3:46, 2022.
  17. Social distance games. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI ’11, pages 91–96. IJCAI/AAAI, 2011.
  18. Hedonic diversity games. In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS ’19, pages 565–573. IFAAMAS, 2019.
  19. Parameterized algorithms for finding a collective set of items. In Proceedings of the 34th AAAI Conference on Artificial Intelligence, AAAI ’20, pages 1838–1845. AAAI Press, 2020.
  20. Topological distance games. In Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI ’23, pages 5549–5556. AAAI Press, 2023.
  21. Optimal seat arrangement: What are the hard and easy cases? In Proceedings of the 32nd International Joint Conference on Artificial Intelligence, IJCAI ’23, pages 2563–2571. ijcai.org, 2023.
  22. Schelling segregation with strategic agents. In Proceedings of the 11th International Symposium on Algorithmic Game Theory, SAGT ’18, pages 137–149. Springer, 2018.
  23. Tight lower bounds for certain parameterized NP-hard problems. Information and Computation, 201(2):216–231, 2005.
  24. Parameterized Algorithms. Springer, 2015.
  25. Andreas Darmann. Stability and welfare in (dichotomous) hedonic diversity games. Theory of Computing Systems, 67(6):1133–1155, 2023.
  26. The parameterized complexity of connected fair division. In Proceedings of the 30th International Joint Conference on Artificial Intelligence, IJCAI ’21, pages 139–145. ijcai.org, 2021.
  27. The parameterized complexity of welfare guarantees in Schelling segregation. In Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems, AAMAS ’23, pages 2860–2862. IFAAMAS, 2023.
  28. The complexity of fair division of indivisible items with externalities. In Proceedings of the 38th AAAI Conference on Artificial Intelligence, AAAI ’24, volume 38, part 9, pages 9653–9661. AAAI Press, 2024.
  29. Reinhard Diestel. Graph Theory, volume 173 of Graduate Texts in Mathematics. Springer, 5th edition, 2017.
  30. Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer ScienceTheor. Comput. Sci., 141(1):109–131, 1995.
  31. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, 2013.
  32. J. H. Drèze and J. Greenberg. Hedonic coalitions: Optimality and stability. Econometrica, 48(4):987–1003, 1980.
  33. Convergence and hardness of strategic Schelling segregation. In Proceedings of the 15th International Conference on Web and Internet Economics, WINE ’19, pages 156–170. Springer, 2019.
  34. Complexity of the Steiner network problem with respect to the number of terminals. In Proceedings of the 36th Symposium on Theoretical Aspects of Computer Science, STACS ’19, pages 25:1–25:17, 2019.
  35. Relaxed core stability in fractional hedonic games. In Proceedings of the 30th International Joint Conference on Artificial Intelligence, IJCAI ’21, pages 182–188. ijcai.org, 2021.
  36. Distance hedonic games. In Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS ’20, pages 1846–1848. IFAAMAS, 2020.
  37. Robert W. Floyd. Algorithm 97: Shortest path. Communications of the ACM, 5(6):345, 1962.
  38. Single-peaked jump Schelling games. In Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems, AAMAS ’23, pages 2899–2901. IFAAMAS, 2023.
  39. Computing shrub-depth decompositions. In Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, STACS ’20, pages 56:1–56:17, 2020.
  40. Maximizing social welfare in score-based social distance games. In Proceedings of the 19th Conference on Theoretical Aspects of Rationality and Knowledge, TARK ’23, pages 272–286, 2023.
  41. Hedonic diversity games: A complexity picture with more than two colors. Artificial Intelligence, 325:104017, 2023.
  42. Shrub-depth: Capturing height of dense graphs. Logical Methods in Computer Science, 15(1), 2019.
  43. Group activity selection with few agent types. Algorithmica, 85(5):1111–1155, 2023.
  44. Complexity results for multiprocessor scheduling under resource constraints. SIAM Journal on Computing, 4(4):397–411, 1975.
  45. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
  46. Hedonic games and treewidth revisited. In Proceedings of the 30th Annual European Symposium on Algorithms, ESA ’22, pages 64:1–64:16, 2022.
  47. Twin-width of planar graphs is at most 8, and at most 6 when bipartite planar. In Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, ICALP ’23, pages 75:1–75:18, 2023.
  48. On the complexity of k𝑘kitalic_k-SAT. Journal of Computer and System Sciences, 62(2):367–375, 2001.
  49. Which problems have strongly exponential complexity? Journal of Computer and System Sciences, 63(4):512–530, 2001.
  50. On the price of stability of social distance games. In Proceedings of the 11th International Symposium on Algorithmic Game Theory, SAGT ’18, pages 125–136. Springer, 2018.
  51. Host community respecting refugee housing. In Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems, AAMAS ’23, pages 966–975. IFAAMAS, 2023.
  52. Equilibria in Schelling games: Computational hardness and robustness. In Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS ’22, pages 761–769. IFAAMAS, 2022.
  53. Partitioning friends fairly. In Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI ’23, pages 5747–5754. AAAI Press, 2023.
  54. Swap stability in refugee housing: A story about anonymous preferences. In 10th European Starting AI Researchers’ Symposium, STAIRS ’23, 2023.
  55. Dániel Marx. Can you beat treewidth? Theory of Computing, 6(1):85–112, 2010.
  56. Rolf Niedermeier. Invitation to Fixed-Parameter Algorithms, volume 31 of Oxford Lecture Series in Mathematics and its Applications. Oxford University Press, 2006.
  57. Dominik Peters. Graphical hedonic games of bounded treewidth. In Proceedings of the 30th AAAI Conference on Artificial Intelligence, AAAI ’16, pages 586–593. AAAI Press, 2016.
  58. Thomas C. Schelling. Models of segregation. The American Economic Review, 59(2):488–493, 1969.
  59. Thomas C. Schelling. Dynamic models of segregation. The Journal of Mathematical Sociology, 1(2):143–186, 1971.
  60. A SAT approach to twin-width. In Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX ’22, pages 67–77. SIAM, 2022.
  61. Computing twin-width with SAT and branch & bound. In Proceedings of the 32nd International Joint Conference on Artificial Intelligence, IJCAI ’23, pages 2013–2021. ijcai.org, 2023.
  62. Šimon Schierreich. Anonymous refugee housing with upper-bounds. CoRR, abs/2308.09501, 2023.
  63. Stephen Warshall. A theorem on boolean matrices. Journal of the ACM, 9(1):11–12, 1962.
  64. Anaëlle Wilczynski. Ordinal hedonic seat arrangement under restricted preference domains: Swap stability and popularity. In Proceedings of the 32nd International Joint Conference on Artificial Intelligence, IJCAI ’23, pages 2906–2914. ijcai.org, 2023.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets