arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.07260cs.DMmath.CO
收藏

最小划分诱导的限制对策$\mathcal{F}$ -凸性的继承复杂性

Complexity of inheritance of $\mathcal{F}$-convexity for restricted games induced by minimum partitions

Alexandre Skoda

摘要:

令$G = (N,E,w)$是加权通信图(具有$E$上的权重函数$w$)。对于每个子集$A \subseteq N$,我们在$A$中具有端点的边的子集$E(A)$中删除$E(A)$中最小权的所有边。然后相应导出子图的连通分支构成$A$的一个划分,我们称之为$P_{\min}(A)$。对于每一个博弈$(N, v)$,我们通过对所有$A \subseteq N$的$\bar{v}(A) = \sum_{F \in P_{\min}(A)} v(F)$定义$P_{\min}$限制的博弈$(N, \bar{v})$.我们证明了我们可以在多项式时间内决定,如果有继承的$\mathcal{F}$ -凸性从$(N, v)$的$P_{\min}$ -限制的游戏$(N, \bar{v})$,其中$\mathcal{F}$ -凸性是通过限制凸连接子集。

英文摘要:

Let $G = (N,E,w)$ be a weighted communication graph (with weight function $w$ on $E$). For every subset $A \subseteq N$, we delete in the subset $E(A)$ of edges with ends in $A$, all edges of minimum weight in $E(A)$. Then the connected components of the corresponding induced subgraph constitute a partition of $A$ that we call $P_{\min}(A)$. For every game $(N, v)$, we define the $P_{\min}$-restricted game $(N, \bar{v})$ by $\bar{v}(A) = \sum_{F \in P_{\min}(A)} v(F)$ for all $A \subseteq N$. We prove that we can decide in polynomial time if there is inheritance of $\mathcal{F}$-convexity from $(N, v)$ to the $P_{\min}$-restricted game $(N, \bar{v})$ where $\mathcal{F}$-convexity is obtained by restricting convexity to connected subsets.

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

↑