Cyclic games and linear programming

New efficient algorithms for solving infinite-duration two-person adversary games with the decision problem inNP@?coNP, based on linear programming (LP), LP-representations, combinatorial LP, linear complementarity problem (LCP), controlled LP are surveyed.

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

[2]  R. Kevin Wood,et al.  Shortest‐path network interdiction , 2002, Networks.

[3]  Vladimir Gurvich,et al.  On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction , 2008, Theory of Computing Systems.

[4]  Gil Kalai,et al.  Linear programming, the simplex algorithm and simple polytopes , 1997, Math. Program..

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

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

[7]  Walter D. Morris.  Randomized pivot algorithms for P-matrix linear complementarity problems , 2002, Math. Program..

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

[9]  G. Dantzig,et al.  A generalization of the linear complementarity problem , 1970 .

[10]  Joseph Naor,et al.  Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality , 1994, SIAM J. Comput..

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

[12]  S. Karamardian.  Generalized complementarity problem , 1970 .

[13]  Katta G. Murty,et al.  Linear complementarity, linear and nonlinear programming , 1988 .

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

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

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

[17]  Ola Svensson,et al.  Linear Programming Polytope and Algorithm for Mean Payoff Games , 2006, AAIM.

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

[19]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

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

[21]  Dean Gillette,et al.  9. STOCHASTIC GAMES WITH ZERO STOP PROBABILITIES , 1958 .

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

[23]  Peter L. Hammer,et al.  From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions , 1988, SIAM J. Discret. Math..

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

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

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

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

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

[29]  M. Paterson,et al.  A deterministic subexponential algorithm for solving parity games , 2006, SODA 2006.

[30]  Michael M. Kostreva,et al.  The Generalized Linear Complementarity Problem: Least Element Theory and Z-Matrices , 1997, J. Glob. Optim..

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

[32]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

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

[34]  Alexander V. Karzanov,et al.  Cyclical games with prohibitions , 1993, Math. Program..

[35]  Gregory E. Coxson,et al.  The P-matrix problem is co-NP-complete , 1994, Math. Program..

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

[37]  Bernd Gärtner,et al.  Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems , 2005, FCT.

[38]  Ola Svensson,et al.  Linear Complementarity and P-Matrices for Stochastic Games , 2006, Ershov Memorial Conference.

[39]  Nimrod Megiddo,et al.  A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems , 1991, Lecture Notes in Computer Science.

[40]  Edith Cohen,et al.  Improved algorithms for linear inequalities with two variables per inequality , 1991, STOC '91.

[41]  S. Vorobyov,et al.  Is Randomized Gurvich-Karzanov-Khachiyan's Algorithm for Parity Games Polynomial? , 2001 .

[42]  Henrik Björklund,et al.  Combinatorial Optimization for Infinite Games on Graphs , 2005 .

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

[44]  Delbert Ray Fulkerson,et al.  Maximizing the minimum source-sink path subject to a budget constraint , 1977, Math. Program..

[45]  Richard W. Cottle,et al.  Linear Complementarity Problem. , 1992 .