arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1703.01121cs.GT
收藏

社交网络上群体活动选择问题的参数化复杂性

On Parameterized Complexity of Group Activity Selection Problems on Social Networks

Ayumi Igarashi, Robert Bredereck, Edith Elkind

摘要:

在群体活动选择问题(GASP)中,参与者组成联盟参与活动,并对形式(活动,群体大小)的配对有偏好。最近,Igarashi等人发起了社交网络(gGASP)上的群体活动选择问题的研究:如果群体成员形成底层通信结构的连通子集,则一组玩家可以参与相同的活动。Igarashi等人主要关注纳什稳定结果,并表明即使对于非常简单的网络,许多相关的算法问题也很难计算。在本文中,我们研究了gGASP的参数化的复杂性,相对于活动的数量,以及相对于玩家的数量,几个解决方案的概念,如纳什稳定性,个人稳定性和核心稳定性。我们考虑的第一个参数是活动的数量。对于这个参数,我们提出了一个FPT算法的纳什稳定性的情况下,社会网络是无环的,并获得了W[1]-硬度结果的集团(即,对于经典的GASP);类似的结果对于个体稳定性也成立。相比之下,即使活动的数量受到一个小常数的限制,也很难找到一个核心稳定的结果,无论是对于经典的GASP还是当社交网络是明星时。我们研究的另一个参数是玩家的数量。虽然我们考虑的所有解决方案的概念成为多项式时间计算时,这个参数是有界的常数,我们证明了W[1]-硬度结果的集团(即,对于经典GASP)。

英文摘要:

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

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑