奇偶对策的小进展测度与分离自动机
Smaller Progress Measures and Separating Automata for Parity Games
摘要:
Calude等人最近证明了奇偶博弈可以在准多项式时间内求解,这是一个里程碑式的结果,导致了许多具有准多项式复杂性的方法。Jurdinski和Lasic进一步改进了奇偶博弈的精确复杂性,特别是当优先级较低时(位置数为对数)。这两种算法都属于一类游戏解决技术,现在通常称为分离自动机:确定性自动机,可用作见证自动机,以决定在给定数量的状态和颜色的奇偶游戏中的赢家。我们建议对Calude等人的方法进行一些调整,从而导致更小的状态空间。这些措施包括和改进了Fearnley等人早些时候介绍的,我们确定了其中两个,一起,导致一个状态空间的大小完全相同的Jurdzinski和Lasic的简洁的进展措施,目前持有冠作为最小的状态空间。剩余的改进,因此,导致进一步减少的状态空间的大小,使我们的方法最简洁的进展措施可用于平价游戏。
英文摘要:
Calude et al. have recently shown that parity games can be solved in quasi-polynomial time, a landmark result that has led to a number of approaches with quasi-polynomial complexity. Jurdinski and Lasic have further improved the precise complexity of parity games, especially when the number of priorities is low (logarithmic in the number of positions). Both of these algorithms belong to a class of game solving techniques now often called separating automata: deterministic automata that can be used as witness automata to decide the winner in parity games up to a given number of states and colours. We suggest a number of adjustments to the approach of Calude et al. that lead to smaller statespaces. These include and improve over those earlier introduced by Fearnley et al. We identify two of them that, together, lead to a statespace of exactly the same size Jurdzinski and Lasic's concise progress measures, which currently hold the crown as smallest statespace. The remaining improvements, hence, lead to a further reduction in the size of the statespace, making our approach the most succinct progress measures available for parity games.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。