On parameterized complexity of group activity selection problems on social networks

Conference item

In Group Activity Selection Problem (GASP), players form coalitions to participate in activities and have preferences over pairs of the form (activity, group size). Recently, Igarashi et al. have initiated the study of group activity selection problems on social networks (gGASP): a group of players can engage in the same activity if the members of the group form a connected subset of the underlying communication structure. Igarashi et al. have primarily focused on Nash stable outcomes, and showed that many associated algorithmic questions are computationally hard even for very simple networks. In this paper we study the parameterized complexity of gGASP with respect to the number of activities as well as with respect to the number of players, for several solution concepts such as Nash stability, individual stability and core stability. The first parameter we consider in the number of activities. For this parameter, we propose an FPT algorithm for Nash stability for the case where the social network is acyclic and obtain a W[1]-hardness result for cliques (i.e., for classic GASP); similar results hold for individual stability. In contrast, finding a core stable outcome is hard even if the number of activities is bounded by a small constant, both for classic GASP and when the social network is a star. Another parameter we study is the number of players. While all solution concepts we consider become polynomial-time computable when this parameter is bounded by a constant, we prove W[1]-hardness results for cliques (i.e., for classic GASP).

Authors: Igarashi, A; Bredereck, R; Elkind, E

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: International Foundation for Autonomous Agents and Multiagent Systems
• Host title: AAMAS '17: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems
• Pages: 1575-1577
• Publication date: 2017-05-08
• Acceptance date: 2016-11-11
• Event title: 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2017)
• Event location: São Paulo, Brazil
• Event website: http://www.ifaamas.org/Proceedings/aamas2017/
• Event start date: 2017-05-08
• Event end date: 2017-05-12
• Language: English
• Keywords: social networks; group activity selection problems; parameterized complexity