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

$\tilde{\mathcal{P}}_{\min}$ -限制对策的凸性继承

Inheritance of Convexity for the $\tilde{\mathcal{P}}_{\min}$-Restricted Game

Alexandre Skoda

摘要:

我们考虑一个与最小划分相关的加权图上的限制性对策。我们将Myerson限制对策的经典定义中的连通分支替换为由特定划分$\tilde{\mathcal{P}}_{\min}$得到的子分支。这种划分依赖于与Grabisch和Skoda(2012)引入的划分$\mathcal{P}_{\min}$相同的原理,但仅限于连接的联盟。更确切地说,这个新的划分$\tilde{\mathcal{P}}_{\min}$是通过删除与联盟相关联的每个连接分量中的最小权重边而引起的。我们提供了一个特征的图形满足继承凸性从底层游戏的限制游戏与$\tilde{\mathcal{P}}_{\min}$。

英文摘要:

We consider a restricted game on weighted graphs associated with minimum partitions. We replace in the classical definition of Myerson restricted game the connected components of any subgraph by the sub-components obtained with a specific partition $\tilde{\mathcal{P}}_{\min}$. This partition relies on the same principle as the partition $\mathcal{P}_{\min}$ introduced by Grabisch and Skoda (2012) but restricted to connected coalitions. More precisely, this new partition $\tilde{\mathcal{P}}_{\min}$ is induced by the deletion of the minimum weight edges in each connected component associated with a coalition. We provide a characterization of the graphs satisfying inheritance of convexity from the underlying game to the restricted game associated with $\tilde{\mathcal{P}}_{\min}$.

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

↑