Combinatorial structure and randomized subexponential algorithms for infinite games

This publication has 22 references indexed in Scilit:

• 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
• Completely unimodal numberings of a simple polytope
  Discrete Applied Mathematics, 1988
• From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions
  SIAM Journal on Discrete Mathematics, 1988
• Cyclic games and an algorithm to find minimax cycle means in directed graphs
  USSR Computational Mathematics and Mathematical Physics, 1988
• Low order polynomial bounds on the expected performance of local improvement algorithms
  Mathematical Programming, 1986
• Positional strategies for mean payoff games
  International Journal of Game Theory, 1979