Nash Stability in Hedonic Skill Games
Pages 706 - 714
Abstract
This article deals with hedonic skill games, the strategic counterpart of coalitional skill games which model collaboration among entities through the abstract notions of tasks and the skills required to complete them. We show that deciding whether an instance of the game admits a Nash stable outcome is NP-complete in the weighted tasks setting. We then characterize the instances admitting a Nash stable outcome in the weighted tasks setting. This characterization relies on the fact that every agent holds (resp., every task requires) either a single skill or more than one skill. For these instances, the complexity of computing a Nash stable outcome is determined, together with the possibility that a natural dynamics converges to a Nash stable outcome from any initial configuration. Our study is completed with a thorough analysis of the price of anarchy of instances always admitting a Nash stable outcome.
References
[1]
Haris Aziz and Bart de Keijzer. 2011. Complexity of coalition structure generation. In Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS). IFAAMAS, South Carolina, 191--198.
[2]
Haris Aziz and Rahul Savani. 2016. Hedonic Games. In Handbook of Computational Social Choice, Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel D. Procaccia (Eds.). Cambridge University Press, USA, 356--376.
[3]
Yoram Bachrach, Reshef Meir, Kyomin Jung, and Pushmeet Kohli. 2010. Coalitional Structure Generation in Skill Games. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI). AAAI Press, Washington D.C (USA), 703--708.
[4]
Yoram Bachrach, David C. Parkes, and Jeffrey S. Rosenschein. 2013. Computing cooperative solution concepts in coalitional skill games. Artificial Intelligence, Vol. 204 (2013), 1--21.
[5]
Yoram Bachrach and Jeffrey S. Rosenschein. 2008. Coalitional skill games. In Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS). IFAAMAS, South Carolina, 1023--1030.
[6]
Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, and Luca Moscardelli. 2019. Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI). ijcai.org, Macao, China, 102--108.
[7]
Bugra Çaskurlu, Fatih Erdem Kizilkaya, and Berkehan Ozen. 2021. Hedonic Expertise Games. In Proceedings of the 14th International Symposium on Algorithmic Game Theory (SAGT) (Lecture Notes in Computer Science, Vol. 12885). Springer, Denmark, 314--328.
[8]
Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, and Gerhard J. Woeginger. 2018. Group activity selection problem with approval preferences. Int. J. Game Theory, Vol. 47, 3 (2018), 767--796.
[9]
J. H. Drèze and J. Greenberg. 1980. Hedonic Coalitions: Optimality and Stability. Econometrica, Vol. 48, 4 (1980), 987--1003.
[10]
Jana Hajdjuková. 2006. Coalition formation Games: a survey. International Game Theory Review, Vol. 8, 4 (2006), 613--641.
[11]
Ayumi Igarashi, Dominik Peters, and Edith Elkind. 2017. Group Activity Selection on Social Networks. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI). AAAI Press, California, USA, 565--571.
[12]
Richard M. Karp. 1972. Reducibility Among Combinatorial Problems. In Proceedings of a symposium on the Complexity of Computer Computations (The IBM Research Symposia Series). Plenum Press, Boston, MA, 85--103.
[13]
Elias Koutsoupias and Christos H. Papadimitriou. 1999. Worst-case Equilibria. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS) (Lecture Notes in Computer Science, Vol. 1563). Springer, New York (USA), 404--413.
[14]
Theodoros Lappas, Kun Liu, and Evimaria Terzi. 2009. Finding a team of experts in social networks. In Proceedings of the 15th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD). ACM, New York City, 467--476.
[15]
Dov Monderer and Lloyd S. Shapley. 1996. Potential Games. Games and Economic Behavior, Vol. 14 (1996), 124--143.
[16]
Noam Nisan, Tim Roughgarden, Éva Tardos, and Vijay V. Vazirani (Eds.). 2007. Algorithmic Game Theory. Cambridge University Press, New York, NY, USA.
[17]
Tenda Okimoto, Nicolas Schwind, Maxime Clement, Tony Ribeiro, Katsumi Inoue, and Pierre Marquis. 2015. How to Form a Task-Oriented Robust Team. In Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems (AAMAS). ACM, Richland, SC, 395--403.
[18]
Robert W. Rosenthal. 1973. A Class of Games Possessing Pure-Strategy Nash Equilibria. International Journal of Game Theory, Vol. 2 (1973), 65--67.
[19]
Walid Saad, Zhu Han, Tamer Basar, Mérouane Debbah, and Are Hjørungnes. 2011. Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents. IEEE Transactions on Mobile Computing, Vol. 10, 9 (2011), 1327--1344.
[20]
Alejandro A. Schäffer and Mihalis Yannakakis. 1991. Simple Local Search Problems That are Hard to Solve. SIAM Journal on Computing, Vol. 20, 1 (1991), 56--87.
[21]
Bernhard von Stengel. 2021. Game Theory Basics. Cambridge University Press, Cambridge (UK).
[22]
Michael J. Wooldridge and Paul E. Dunne. 2006. On the computational complexity of coalitional resource games. Artificial Intelligence, Vol. 170, 10 (2006), 835--871.
Recommendations
Hedonic clustering games
SPAA '12: Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architecturesClustering, the partitioning of objects with respect to a similarity measure, has been extensively studied as a global optimization problem. We investigate clustering from a game theoretic approach, and consider the class of hedonic clustering games. ...
Hedonic Clustering Games
Special Issue on SPAA 2012Clustering, the partitioning of objects with respect to a similarity measure, has been extensively studied as a global optimization problem. We investigate clustering from a game-theoretic approach, and consider the class of hedonic clustering games. ...
Distance Hedonic Games
AAMAS '20: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent SystemsIn this paper we consider Distance Hedonic Games, a class of non-transferable utility coalition formation games that properly generalizes previously existing models, like Social Distance Games and Fractional Hedonic Games. In particular, in Distance ...
Comments
Information & Contributors
Information
Published In
May 2024
2898 pages
ISBN:9798400704864
- General Chairs:
- Mehdi Dastani,
- Jaime Simão Sichman,
- Program Chairs:
- Natasha Alechina,
- Virginia Dignum
Sponsors
Publisher
International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC
Publication History
Published: 06 May 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Laurent Gourves is supported by Agence Nationale de la Recherche (ANR) project THEMIS ANR-20-CE23-0018
Conference
AAMAS '24
Sponsor:
AAMAS '24: International Conference on Autonomous Agents and Multiagent Systems
May 6 - 10, 2024
Auckland, New Zealand
Acceptance Rates
Overall Acceptance Rate 1,155 of 5,036 submissions, 23%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 28Total Downloads
- Downloads (Last 12 months)28
- Downloads (Last 6 weeks)4
Reflects downloads up to 26 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in