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

群体活动选择问题

Group Activity Selection Problem

Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard Woeginger

摘要:

我们考虑一个设置,其中一个组织一个或几个组活动的一组代理。每个代理最多参与一个活动,她对活动的偏好取决于活动中参与者的数量。目标是根据代理的偏好将其分配给活动。我们提出了一个一般模型,这是一个自然的推广匿名享乐游戏。然后,我们专注于我们的模型的一个特殊情况下,代理的偏好是二元的,即,每个代理将形式为“(活动,组大小)”的所有对分类为可接受的对和不可接受的对。我们制定了几个解决方案的概念,这种情况下,并从计算的角度来研究它们,提供硬度的一般情况下的结果,以及有效的算法设置代理的偏好满足一定的自然约束。

英文摘要:

We consider a setting where one has to organize one or several group activities for a set of agents. Each agent will participate in at most one activity, and her preferences over activities depend on the number of participants in the activity. The goal is to assign agents to activities based on their preferences. We put forward a general model for this setting, which is a natural generalization of anonymous hedonic games. We then focus on a special case of our model, where agents' preferences are binary, i.e., each agent classifies all pairs of the form "(activity, group size)" into ones that are acceptable and ones that are not. We formulate several solution concepts for this scenario, and study them from the computational point of view, providing hardness results for the general case as well as efficient algorithms for settings where agents' preferences satisfy certain natural constraints.

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

↑