论文标题
最大K-CUT游戏：稳定的最佳颜色
The Max k-Cut Game: On Stable Optimal Colorings
论文作者
论文摘要
我们在未指向且未加权的图上研究最大K-CUT游戏，以找出最佳解决方案是否也是强大的平衡。尽管我们确实无法证明这一点，但通过证明用于计算强偏差的剪切值差的替代公式，我们表明最佳解决方案是7稳定的平衡。 此外，我们证明了最小亚集的某些特性，相对于强偏差，表明他们的每个节点都会偏向一个邻居的颜色，并且这些子集诱导了连接的子图。
We study the max k-cut game on an undirected and unweighted graph in order to find out whether an optimal solution is also a strong equilibrium. While we do fail to show that, by proving an alternate formula for computing the cut value difference for a strong deviation, we show that optimal solutions are 7-stable equilibria. Furthermore, we prove some properties of minimal subsets with respect to a strong deviation, showing that each of their nodes will deviate towards the color of one of their neighbors and that those subsets induce connected subgraphs.
