A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
- 15 January 2007
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 155 (2) , 210-229
- https://doi.org/10.1016/j.dam.2006.04.029
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc InterdictionPublished by Springer Nature ,2006
- Combinatorial structure and randomized subexponential algorithms for infinite gamesTheoretical Computer Science, 2005
- Memoryless determinacy of parity and mean payoff games: a simple proofTheoretical Computer Science, 2004
- A Discrete Subexponential Algorithm for Parity GamesPublished by Springer Nature ,2003
- On algorithms for simple stochastic gamesPublished by American Mathematical Society (AMS) ,1993
- On model-checking for fragments of μ-calculusPublished by Springer Nature ,1993
- The complexity of stochastic gamesInformation and Computation, 1992
- Cyclic games and an algorithm to find minimax cycle means in directed graphsUSSR Computational Mathematics and Mathematical Physics, 1988
- Positional strategies for mean payoff gamesInternational Journal of Game Theory, 1979
- On Nonterminating Stochastic GamesManagement Science, 1966