arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1703.01296cs.LO
收藏

拟多项式时间和拟线性空间中奇偶对策的有序解法

An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space

John Fearnley, Sanjay Jain, Sven Schewe, Frank Stephan, Dominik Wojtczak

摘要:

奇偶博弈在模型检验和模型综合中起着重要的作用。在他们的论文中,Calude等人证明了这些博弈可以在准多项式时间内求解。我们表明,他们的算法可以有效地实现:我们使用他们的数据结构作为一个进步的措施,允许向后实现,而不是一个完整的解开的游戏。为了实现这一点,他们的技术必须做出一些改变,其中主要的一个是增加对抗玩家的力量,允许在不改变游戏结果的情况下确定她的理性举动。我们提供了一个准多项式算法的第一个实现,测试它的小例子,并提供了一些副作用,包括轻微的算法改进,一个准双线性复杂的状态和边缘的数量为一个固定数量的颜色,和匹配的下限Calude等人的算法。

英文摘要:

Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have shown that these games can be solved in quasi-polynomial time. We show that their algorithm can be implemented efficiently: we use their data structure as a progress measure, allowing for a backward implementation instead of a complete unravelling of the game. To achieve this, a number of changes have to be made to their techniques, where the main one is to add power to the antagonistic player that allows for determining her rational move without changing the outcome of the game. We provide a first implementation for a quasi-polynomial algorithm, test it on small examples, and provide a number of side results, including minor algorithmic improvements, a quasi bi-linear complexity in the number of states and edges for a fixed number of colours, and matching lower bounds for the algorithm of Calude et al.

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

↑