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

计算三维平均宽度的Shapley值

Computing Shapley Values for Mean Width in 3-D

Shuhao Tan

摘要:

Shapley值是博弈论中评估合作环境中参与者重要性的常用工具。在几何背景下,它提供了一种方法来测量集合中的几何对象对集合上的某个函数的贡献。最近,Cabello和Chan(SoCG 2019)提出了计算平面中点集的许多函数的Shapley值的算法。更正式地说,联盟博弈由一组参与者$N$和一个具有$v(\emptyset) = 0$的特征函数$v: 2^N \to \mathbb{R}$组成。令$π$是$N$的均匀随机置换,并且$P_N(π, i)$是$N$中出现在置换$π$中的参与者$i$之前的参与者的集合。游戏的Shapley值被定义为$ϕ(i) = \mathbb{E}_π[v(P_N(π, i) \cup \{i\}) - v(P_N(π, i))]$。更直观地,Shapley值表示玩家$i$的出现对所有插入顺序的影响。我们提出了一个算法来计算Shapley值在3-D,我们把点作为球员,并使用的平均宽度的凸包作为特征函数。我们的算法运行在$O(n^3\log^2{n})$时间和$O(n)$空间。我们的方法是基于一个新的数据结构的一个变种的动态卷积问题$(u, v, p)$,我们要回答$u\cdot v$动态。我们的数据结构支持在位置$p$处更新$u$,增加和减少$p$以及通过$1$旋转$v$。我们提出了一个数据结构,支持$n$操作在$O(n\log^2{n})$时间和$O(n)$空间。此外,相同的方法可以用于计算对于$d$维空间($d \geq 3$)中的点集在$O(n^d\log^2{n})$时间和$O(n)$空间中的均匀随机$(d - 2)$子空间上的凸包投影的平均体积的Shapley值。

英文摘要:

The Shapley value is a common tool in game theory to evaluate the importance of a player in a cooperative setting. In a geometric context, it provides a way to measure the contribution of a geometric object in a set towards some function on the set. Recently, Cabello and Chan (SoCG 2019) presented algorithms for computing Shapley values for a number of functions for point sets in the plane. More formally, a coalition game consists of a set of players $N$ and a characteristic function $v: 2^N \to \mathbb{R}$ with $v(\emptyset) = 0$. Let $π$ be a uniformly random permutation of $N$, and $P_N(π, i)$ be the set of players in $N$ that appear before player $i$ in the permutation $π$. The Shapley value of the game is defined to be $ϕ(i) = \mathbb{E}_π[v(P_N(π, i) \cup \{i\}) - v(P_N(π, i))]$. More intuitively, the Shapley value represents the impact of player $i$'s appearance over all insertion orders. We present an algorithm to compute Shapley values in 3-D, where we treat points as players and use the mean width of the convex hull as the characteristic function. Our algorithm runs in $O(n^3\log^2{n})$ time and $O(n)$ space. Our approach is based on a new data structure for a variant of the dynamic convolution problem $(u, v, p)$, where we want to answer $u\cdot v$ dynamically. Our data structure supports updating $u$ at position $p$, incrementing and decrementing $p$ and rotating $v$ by $1$. We present a data structure that supports $n$ operations in $O(n\log^2{n})$ time and $O(n)$ space. Moreover, the same approach can be used to compute the Shapley values for the mean volume of the convex hull projection onto a uniformly random $(d - 2)$-subspace in $O(n^d\log^2{n})$ time and $O(n)$ space for a point set in $d$-dimensional space ($d \geq 3$).

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

↑