• Corpus ID: 233739838

Priority Promotion with Parysian Flair

@article{Benerecetti2021PriorityPW,
  title={Priority Promotion with Parysian Flair},
  author={Massimo Benerecetti and Daniele Dell'Erba and Fabio Mogavero and Sven Schewe and Dominik Wojtczak},
  journal={ArXiv},
  year={2021},
  volume={abs/2105.01738}
}
We develop an algorithm that combines the advantages of priority promotion - the leading approach 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… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 80 REFERENCES
A Recursive Approach to Solving Parity Games in Quasipolynomial Time
TLDR
This work presents a modification of Zielonka’s classic algorithm that brings its complexity down to n O ( log ( 1+ d log n )) , for parity games of size n with d priorities, in line with previous quasipolynomial-time solutions.
Succinct progress measures for solving parity games
  • M. Jurdzinski, R. Lazic
  • Computer Science, Mathematics
    2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2017
TLDR
An alternative quasi-polynomial time algorithm based on progress measures is devised, which allows the space required from quasi- polynomial to nearly linear, and a novel concept of ordered tree coding is introduced.
A Delayed Promotion Policy for Parity Games
TLDR
A new instantiation, called delayed promotion, is proposed that tries to reduce the possible exponential behaviours exhibited by the original method in the worst case, and not only often outperforms the original priority promotion approach, but so far no exponential worst case is known.
A Parity Game Tale of Two Counters
TLDR
This paper presents a parameterized parity game called the Two Counters game, which provides an exponential lower bound for a wide range of parity game solving algorithms and is the first to provide an exponentialLower bound to priority promotion with the delayed promotion policy, and theFirst to provide such a lower bound to tangle learning.
Non-oblivious Strategy Improvement
TLDR
A structural property of these games is described, and it is shown that these structures can affect the behaviour of strategy improvement and can be used to accelerate strategy improvement algorithms.
Solving parity games in big steps
  • S. Schewe
  • Computer Science
    J. Comput. Syst. Sci.
  • 2007
Improving Priority Promotion for Parity Games
TLDR
A new instantiation, called region recovery, is proposed that tries to reduce the possible exponential behaviours exhibited by the original method in the worst case, and not only often outperforms the original priority promotion approach, but so far no exponential worst case is known.
An Improved Recursive Algorithm for Parity Games
TLDR
An improved recursive algorithm is presented in this paper for reducing the number of recursive calls in parity games and a conditional statement is inserted before the second recursive call of the existing algorithm where in case the condition is satisfied, the result can be obtained directly without executing the first recursive call.
An ordered approach to solving parity games in quasi polynomial time and quasi linear space
TLDR
A first implementation for a quasi-polynomial algorithm is provided, and a number of side results are provided, 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.
...
...