社交网络上的群体活动选择
Group Activity Selection on Social Networks
摘要:
我们提出了一个新的变体的组活动选择问题(GASP),其中代理被放置在一个社会网络和活动只能被分配到连接的子组。我们表明,如果多个群体可以同时从事同一活动,只要网络是非循环的,找到一个稳定的结果是很容易的。相比之下,如果每个活动只能被分配到一个组,那么找到稳定的结果就变得很困难,即使底层网络非常简单:当社交网络是一条路径、一颗星,或者每个连接组件的大小都有一个常数时,确定GASP的给定实例是否允许纳什稳定结果的问题就变成了NP难问题。另一方面,我们得到固定参数的易处理性结果,这个问题的活动的数量。
英文摘要:
We propose a new variant of the group activity selection problem (GASP), where the agents are placed on a social network and activities can only be assigned to connected subgroups. We show that if multiple groups can simultaneously engage in the same activity, finding a stable outcome is easy as long as the network is acyclic. In contrast, if each activity can be assigned to a single group only, finding stable outcomes becomes intractable, even if the underlying network is very simple: the problem of determining whether a given instance of a GASP admits a Nash stable outcome turns out to be NP-hard when the social network is a path, a star, or if the size of each connected component is bounded by a constant. On the other hand, we obtain fixed-parameter tractability results for this problem with respect to the number of activities.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。