A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games

[1]  Vladimir Gurvich,et al.  Extending Dijkstra's Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction , 2006, CSR.

[2]  Henrik Björklund,et al.  Combinatorial structure and randomized subexponential algorithms for infinite games , 2005, Theor. Comput. Sci..

[3]  Henrik Björklund,et al.  Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework , 2003, Ershov Memorial Conference.

[4]  Henrik Björklund,et al.  A Discrete Subexponential Algorithm for Parity Games , 2003, STACS.

[5]  Viktor Petersson,et al.  A Randomized Subexponential Algorithm for Parity Games , 2001, Nord. J. Comput..

[6]  Marcin Jurdzinski,et al.  A Discrete Strategy Improvement Algorithm for Solving Parity Games , 2000, CAV.

[7]  Nicolai N. Pisaruk,et al.  Mean Cost Cyclical Games , 1999, Math. Oper. Res..

[8]  A. Puri.  Theory of hybrid systems and discrete event systems , 1996 .

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

[10]  Walter Ludwig,et al.  A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem , 1995, Inf. Comput..

[11]  A. Prasad Sistla,et al.  On Model-Checking for Fragments of µ-Calculus , 1993, CAV.

[12]  Micha Sharir,et al.  A subexponential bound for linear programming , 1992, SCG '92.

[13]  Gil Kalai,et al.  A subexponential randomized simplex algorithm (extended abstract) , 1992, STOC '92.

[14]  Anne Condon,et al.  The Complexity of Stochastic Games , 1992, Inf. Comput..

[15]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

[17]  Kathy Williamson Hoke,et al.  Completely unimodal numberings of a simple polytope , 1988, Discret. Appl. Math..

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

[19]  H. Moulin.  Extensions of two person zero sum games , 1976 .

[20]  S. Vorobyov,et al.  Fast Algorithms for Monotonic Discounted Linear Programs with Two Variables per Inequality , 2006 .

[21]  O. Svensson,et al.  Linear Complementarity Algorithms for Mean Payoff Games , 2005 .

[22]  O. Svensson,et al.  A Subexponential Algorithm for a Subclass of P-Matrix Generalized Linear Complementarity Problems , 2005 .

[23]  Henrik Björklund,et al.  Memoryless determinacy of parity and mean payoff games: a simple proof , 2004, Theor. Comput. Sci..

[24]  Henrik Björklund,et al.  Randomized Subexponential Algorithms for Infinite Games , 2004 .

[25]  Henrik Björklund,et al.  Controlled Linear Programming for Infinite Games , 2004 .

[26]  Henrik Björklund,et al.  The Controlled Linear Programming Problem , 2004 .

[27]  O. Svensson,et al.  Controlled Linear Programming: Boundedness and Duality , 2004 .

[28]  Henrik Björklund,et al.  On Combinatorial Structure and Algorithms for Parity Games , 2003 .

[29]  E. Allen Emerson,et al.  Model Checking and the Mu-calculus , 1996, Descriptive Complexity and Finite Models.

[30]  Anne Condon,et al.  On Algorithms for Simple Stochastic Games , 1990, Advances In Computational Complexity Theory.

[31]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[32]  H. Moulin.  Prolongement des jeux à deux joueurs de somme nulle. Une théorie abstraite des duels , 1976 .

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