Using Strategy Improvement to Stay Alive

We design a novel algorithm for solving Mean-Payoff Games (MPGs). Besides solving an MPG in the usual sense, our algorithm computes more information about the game, information that is important with respect to applications. The weights of the edges of an MPG can be thought of as a gained/consumed energy -- depending on the sign. For each vertex, our algorithm computes the minimum amount of initial energy that is sufficient for player Max to ensure that in a play starting from the vertex, the energy level never goes below zero. Our algorithm is not the first algorithm that computes the minimum sufficient initial energies, but according to our experimental study it is the fastest algorithm that computes them. The reason is that it utilizes the strategy improvement technique which is very efficient in practice.

[1]  Ali Dasdan,et al.  An Experimental Study of Minimum Mean Cycle Algorithms , 1998 .

[2]  Henrik Björklund,et al.  A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games , 2007, Discrete Applied Mathematics.

[3]  A. Karzanov,et al.  Cyclic games and an algorithm to find minimax cycle means in directed graphs , 1990 .

[4]  Jakub Chaloupka,et al.  Parallel Algorithms for Mean-Payoff Games: An Experimental Evaluation , 2009, ESA.

[5]  Andrew V. Goldberg,et al.  An Experimental Study of Minimum Mean Cycle Algorithms , 2009, ALENEX.

[6]  Kim G. Larsen,et al.  Infinite Runs in Weighted Timed Automata with Energy Constraints , 2008, FORMATS.

[7]  L. Brim,et al.  Faster algorithms for mean-payoff games , 2011, Formal Methods Syst. Des..

[8]  Jakub Chaloupka,et al.  Faster Algorithm for Mean-Payoff Games , 2009, MEMICS.

[9]  Sven Schewe,et al.  An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games , 2008, CSL.

[10]  Thomas A. Henzinger,et al.  Resource Interfaces , 2003, EMSOFT.

[11]  R. Karp,et al.  On Nonterminating Stochastic Games , 1966 .

[12]  Lubos Brim,et al.  Using Strategy Improvement to Stay Alive , 2012, Int. J. Found. Comput. Sci..

[13]  Uri Zwick,et al.  The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..

[14]  Henrik Björklund,et al.  A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games , 2007, Discret. Appl. Math..

[15]  Andrew V. Goldberg,et al.  Negative-cycle detection algorithms , 1996, Math. Program..

[16]  S. Gaubert,et al.  A policy iteration algorithm for zero-sum stochastic games with mean payoff , 2006 .

[17]  A. Ehrenfeucht,et al.  Positional strategies for mean payoff games , 1979 .

[18]  Andrew V. Goldberg,et al.  Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.