A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games

This publication has 20 references indexed in Scilit:

• Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework
  Published by Springer Nature ,2004
• A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games
  Published by Springer Nature ,2004
• Memoryless determinacy of parity and mean payoff games: a simple proof
  Theoretical Computer Science, 2004
• A subexponential bound for linear programming
  Algorithmica, 1996
• The complexity of mean payoff games on graphs
  Theoretical Computer Science, 1996
• A SUBEXPONENTIAL RANDOMIZED ALGORITHM FOR THE SIMPLE STOCHASTIC GAME PROBLEM
  Information and Computation, 1995
• The complexity of stochastic games
  Information and Computation, 1992
• Cyclic games and an algorithm to find minimax cycle means in directed graphs
  USSR Computational Mathematics and Mathematical Physics, 1988
• Positional strategies for mean payoff games
  International Journal of Game Theory, 1979
• Extensions of two person zero sum games
  Journal of Mathematical Analysis and Applications, 1976