求解2.5人奇偶对策的综合策略改进与递归算法
Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games
摘要：
2.5玩家平价游戏结合了2.5玩家可达性游戏和平价游戏的定性分析所带来的挑战。这两种类型的问题最好用不同类型的算法来处理：2.5玩家可达性游戏的策略改进算法和奇偶游戏定性分析的递归算法。我们提出了一种方法，与现有的技术相比，解决这两个方面的最适合的方法，并专门在2.5玩家游戏本身。由此产生的技术足够强大，可以处理数百万个状态的游戏。
英文摘要：
2.5 player parity games combine the challenges posed by 2.5 player reachability games and the qualitative analysis of parity games. These two types of problems are best approached with different types of algorithms: strategy improvement algorithms for 2.5 player reachability games and recursive algorithms for the qualitative analysis of parity games. We present a method that - in contrast to existing techniques - tackles both aspects with the best suited approach and works exclusively on the 2.5 player game itself. The resulting technique is powerful enough to handle games with several million states.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
