arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1705.02748cs.GT
收藏

计算近似最优可分配项集

Computing an Approximately Optimal Agreeable Set of Items

Pasin Manurangsi, Warut Suksompong

摘要:

我们研究的问题,找到一个小的子集的项目,是\emph{agreeable}的所有代理,这意味着所有的代理值的子集至少一样多,其补充。以前的工作已经显示了最坏情况下的界限,在所有的实例与给定数量的代理和项目,可能需要包括在这样的子集的项目的数量。在本文中,我们的目标是有效地计算一个令人满意的子集,其大小近似于给定实例的最小令人满意的子集的大小。我们认为三个著名的模型代表的代理商的偏好:顺序偏好的单个项目,值的预言机模型,和添加剂的效用。在这些模型中的每一个,我们建立几乎严格的边界上的近似比,可以通过运行在多项式时间的算法。

英文摘要:

We study the problem of finding a small subset of items that is \emph{agreeable} to all agents, meaning that all agents value the subset at least as much as its complement. Previous work has shown worst-case bounds, over all instances with a given number of agents and items, on the number of items that may need to be included in such a subset. Our goal in this paper is to efficiently compute an agreeable subset whose size approximates the size of the smallest agreeable subset for a given instance. We consider three well-known models for representing the preferences of the agents: ordinal preferences on single items, the value oracle model, and additive utilities. In each of these models, we establish virtually tight bounds on the approximation ratio that can be obtained by algorithms running in polynomial time.

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

↑