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

背包博弈中的Shapley值

The Shapley Value in Knapsack Budgeted Games

Smriti Bhagat, Anthony Kim, S. Muthukrishnan, Udi Weinsberg

摘要:

我们提出了一类新的合作游戏,我们称之为预算的游戏计算Shapley值的研究,特别是背包预算的游戏,一个版本的经典背包问题建模。在这些游戏中,由于预算约束限制了$T$的大小,代理的集合$S$的“值”仅由代理的关键子集$T\subseteq S$确定,而不是全部$S$。我们表明,Shapley值可以计算的时间比天真的指数时间算法时,有足够多的代理,也提供了一个算法,近似的Shapley值内的附加误差。对于一个相关的预算游戏与贪婪的启发式,我们表明,Shapley值可以计算在伪多项式时间。此外,我们推广我们的证明技术,并提出了我们的术语算法表示框架,捕获广泛的合作游戏的Shapley值的有效计算的属性。其主要思想是,确定有效的计算的问题,可以减少到找到一个替代的表示的游戏和相关的算法,用于计算的基本价值函数的小的时间和空间复杂度的表示大小。

英文摘要:

We propose the study of computing the Shapley value for a new class of cooperative games that we call budgeted games, and investigate in particular knapsack budgeted games, a version modeled after the classical knapsack problem. In these games, the "value" of a set $S$ of agents is determined only by a critical subset $T\subseteq S$ of the agents and not the entirety of $S$ due to a budget constraint that limits how large $T$ can be. We show that the Shapley value can be computed in time faster than by the naïve exponential time algorithm when there are sufficiently many agents, and also provide an algorithm that approximates the Shapley value within an additive error. For a related budgeted game associated with a greedy heuristic, we show that the Shapley value can be computed in pseudo-polynomial time. Furthermore, we generalize our proof techniques and propose what we term algorithmic representation framework that captures a broad class of cooperative games with the property of efficient computation of the Shapley value. The main idea is that the problem of determining the efficient computation can be reduced to that of finding an alternative representation of the games and an associated algorithm for computing the underlying value function with small time and space complexities in the representation size.

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

↑