$\mathcal{P}_{\min}$ -限制对策的凸性继承
Inheritance of Convexity for the $\mathcal{P}_{\min}$-Restricted Game
摘要:
我们考虑与最小划分相关的加权图上的限制性博弈。我们将经典的Myerson限制对策定义中的连通分支替换为对应于最小划分的子分支。该最小划分$\mathcal{P}_{\min}$是通过删除最小权重边而导出的。我们提供了一个表征的图形满足继承的凸性从底层游戏的限制游戏与Pmin。此外,我们还证明了这些图可以在多项式时间内被识别。
英文摘要:
We consider restricted games 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 subcomponents corresponding to a minimum partition. This minimum partition $\mathcal{P}_{\min}$ is induced by the deletion of the minimum weight edges. We provide a characterization of the graphs satisfying inheritance of convexity from the underlying game to the restricted game associated with Pmin. Moreover, we prove that these graphs can be recognized in polynomial time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。