arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.3044cs.GTcs.AIcs.MA
收藏

寻找一个集合的项目集:从比例多代表到群体推荐

Finding a Collective Set of Items: From Proportional Multirepresentation to Group Recommendation

University of Warsaw(华沙大学);AGH University(AGH大学);Université Paris-Dauphine(巴黎第九大学)

Piotr Skowron, Piotr Faliszewski, Jerome Lang

摘要:

我们考虑以下问题:存在一组项目(例如,电影)和一组代理(例如,飞机上的乘客);每个代理对每个项目都有一些内在效用。我们的目标是选择一组$K$项目,使所有代理的总衍生效用最大化(即,在我们的示例中,我们要挑选我们放在飞机的娱乐系统上的$K$电影)。然而,代理人从给定项目中获得的实际效用只是其内在效用的一小部分,而这一小部分取决于代理人如何将该项目在所选择的可用项目中进行排名。我们提供了一个正式的规格模型,并提供具体的例子和设置,它是适用的。我们表明,这个问题是很难在一般情况下,但我们展示了一些易处理的结果,其自然的特殊情况。

英文摘要:

We consider the following problem: There is a set of items (e.g., movies) and a group of agents (e.g., passengers on a plane); each agent has some intrinsic utility for each of the items. Our goal is to pick a set of $K$ items that maximize the total derived utility of all the agents (i.e., in our example we are to pick $K$ movies that we put on the plane's entertainment system). However, the actual utility that an agent derives from a given item is only a fraction of its intrinsic one, and this fraction depends on how the agent ranks the item among the chosen, available, ones. We provide a formal specification of the model and provide concrete examples and settings where it is applicable. We show that the problem is hard in general, but we show a number of tractability results for its natural special cases.

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

↑