We develop an algorithm that combines the advantages of priority promotion - one of the leading approaches to solving large parity games in practice - with the quasi-polynomial time guarantees offered by Parys' algorithm. Hybridising these algorithms sounds both natural and difficult, as they both generalise the classic recursive algorithm in different ways that appear to be irreconcilable: while the promotion transcends the call structure, the guarantees change on each level. We show that an interface that respects both is not only effective, but also efficient.

翻译：我们开发了一种算法,将优先促进的好处结合起来 — — 这是在实践中解决大型对等游戏的主要方法之一 — — 与Parys算法提供的准球性时间保障相结合。 将这些算法结合起来既自然又困难,因为这两种算法都以看起来无法调和的不同方式概括了经典的累进算法:虽然促进超越了呼唤结构,但每个层次的保障都发生了变化。 我们表明,一个既尊重两者的界面不仅有效,而且有效。