A Discrete Strategy Improvement Algorithm for Solving Parity Games
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 202-215
- https://doi.org/10.1007/10722167_18
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Implementation of a Strategy Improvement Algorithm for Finite-State Parity GamesPublished by Springer Nature ,2001
- Small Progress Measures for Solving Parity GamesPublished by Springer Nature ,2000
- Infinite games on finitely coloured graphs with applications to automata on infinite treesTheoretical Computer Science, 1998
- An improved algorithm for the evaluation of fixpoint expressionsTheoretical Computer Science, 1997
- Fast and simple nested fixpointsInformation Processing Letters, 1996
- The complexity of mean payoff games on graphsTheoretical Computer Science, 1996
- Infinite games played on finite graphsAnnals of Pure and Applied Logic, 1993
- The complexity of stochastic gamesInformation and Computation, 1992
- Towards a Genuinely Polynomial Algorithm for Linear ProgrammingSIAM Journal on Computing, 1983
- Positional strategies for mean payoff gamesInternational Journal of Game Theory, 1979