Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games

@inproceedings{Benerecetti2017RobustEW,
  title={Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games},
  author={M. Benerecetti and Daniele Dell'Erba and F. Mogavero},
  booktitle={GandALF},
  year={2017}
}
  • M. Benerecetti, Daniele Dell'Erba, F. Mogavero
  • Published in GandALF 2017
  • Computer Science, Mathematics
  • The McNaughton-Zielonka divide et impera algorithm is the simplest and most flexible approach available in the literature for determining the winner in a parity game. Despite its theoretical worst-case complexity and the negative reputation as a poorly effective algorithm in practice, it has been shown to rank among the best techniques for the solution of such games. Also, it proved to be resistant to a lower bound attack, even more than the strategy improvements approaches, and only recently a… CONTINUE READING
    8 Citations

    Figures and Topics from this paper.

    Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
    • 12
    • PDF
    A Delayed Promotion Policy for Parity Games
    • 8
    • PDF
    A delayed promotion policy for parity games
    • 2
    Register Games
    • 2
    • PDF
    A modal μ perspective on solving parity games in quasi-polynomial time
    • 41
    • PDF
    A Parity Game Tale of Two Counters
    • T. V. Dijk
    • Mathematics, Computer Science
    • GandALF
    • 2019
    • 1
    • PDF
    Attracting Tangles to Solve Parity Games
    • 7
    • PDF

    References

    SHOWING 1-10 OF 57 REFERENCES
    Small Progress Measures for Solving Parity Games
    • 444
    • PDF
    Deciding parity games in quasipolynomial time
    • 132
    • PDF
    Solving Parity Games in Big Steps
    • 121
    • PDF
    Improving Priority Promotion for Parity Games
    • 8
    • PDF
    A Delayed Promotion Policy for Parity Games
    • 8
    • PDF
    Solving parity games via priority promotion
    • 11
    • PDF
    Succinct progress measures for solving parity games
    • M. Jurdzinski, R. Lazic
    • Computer Science
    • 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
    • 2017
    • 68
    • PDF