Linear Complementarity Algorithms for Infinite Games

The performance of two pivoting algorithms, due to Lemke and Cottle and Dantzig, is studied on linear complementarity problems (LCPs) that arise from infinite games, such as parity, average-reward, and discounted games. The algorithms have not been previously studied in the context of infinite games, and they offer alternatives to the classical strategy-improvement algorithms. The two algorithms are described purely in terms of discounted games, thus bypassing the reduction from the games to LCPs, and hence facilitating a better understanding of the algorithms when applied to games. A family of parity games is given, on which both algorithms run in exponential time, indicating that in the worst case they perform no better for parity, average-reward, or discounted games than they do for general P-matrix LCPs.

[1]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[2]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[3]  Rahul Savani,et al.  A Simple P-Matrix Linear Complementarity Problem for Discounted Games , 2008, CiE.

[4]  Marcin Jurdziński,et al.  Deciding the Winner in Parity Games is in UP \cap co-Up , 1998, Inf. Process. Lett..

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

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

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

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

[9]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[10]  Colin Stirling,et al.  Lokal Model Checking Games , 1995, CONCUR.

[11]  Anne Condon,et al.  On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes , 1994, INFORMS J. Comput..

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

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

[14]  Nimrod Megiddo,et al.  A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension , 1985, JACM.

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

[16]  J. Filar,et al.  Competitive Markov Decision Processes , 1996 .

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

[18]  Oliver Friedmann,et al.  A Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it , 2009, ArXiv.

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

[20]  Colin Stirling,et al.  Local model checking games (extended abstract) , 1995 .

[21]  Richard W. Cottle,et al.  Linear Complementarity Problem , 2009, Encyclopedia of Optimization.

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

[23]  S. J. Chung.  NP-Completeness of the linear complementarity problem , 1989 .