带颜色顶点的位置确定性:从单人到双人的提升
Positional Determinacy with Colored Vertices: a 1-to-2-Player Lift
AI总结:
研究顶点着色博弈中前缀无关目标\(W\),证明其在所有顶点着色单人、双人博弈上位置确定以及等同于颜色有序对的奇偶目标这三者等价,还表明颜色集有限性是等价关键,所开发技术建立了两类博弈的双向对应。
摘要:
20世纪90年代证明了顶点着色奇偶博弈的位置确定性,这直接意味着边着色奇偶博弈的位置确定性。2006年表明,如果基于颜色的前缀无关目标能确保每个边着色双人回合制博弈是位置确定的,那么这个目标等同于奇偶目标。我们证明了顶点着色博弈的类似结果,即对于有限颜色集上的任何前缀无关目标\(W\),以下三者等价:\(W\)在所有顶点着色单人博弈上是位置确定的;\(W\)在所有顶点着色双人博弈上是位置确定的;\(W\)等同于颜色有序对的奇偶目标。我们证明了颜色集的有限性是等价关系成立的必要条件。除了这种从单人到双人的提升,我们处理颜色对所开发的技术在边着色博弈和顶点着色博弈之间建立了一种有前景的双向对应关系。
英文摘要:
Positional determinacy of vertex-colored parity games was proved in the 1990s, which directly implies positional determinacy of edge-colored parity games. In 2006, it was shown that if a prefix-independent color-based objective ensures that every edge-colored two-player turn-based game is positionally determined, this objective is equivalent to a parity objective. We prove a similar result for vertex-colored games, namely that the following are equivalent for any prefix-independent objective $W$ over a finite set of colors: - $W$ is positionally determined on all vertex-colored one-player games. - $W$ is positionally determined on all vertex-colored two-player games. - $W$ is equivalent to a parity objective on ordrerd pairs of colors. We prove that finiteness of the color set is required for our equivalence to hold. Beyond this $1$-to-$2$-player lift, the technique that we develop to handle the pairs of colors establishes a promising 2-way correspondence between edge-colored games and vertex-colored games.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。