A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The complexity of stochastic games
Information and Computation
A subexponential randomized algorithm for the simple stochastic game problem
Information and Computation
The complexity of mean payoff games on graphs
Theoretical Computer Science
Theory of hybrid systems and discrete event systems
Theory of hybrid systems and discrete event systems
Vertical Block Hidden Z-Matrices And The Generalized Linear Complementarity Problem
SIAM Journal on Matrix Analysis and Applications
Linear programming, the simplex algorithm and simple polytopes
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Unique sink orientations of grids
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Violator spaces: structure and algorithms
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Cyclic games and linear programming
Discrete Applied Mathematics
A Simple P-Matrix Linear Complementarity Problem for Discounted Games
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
A CSP-Based Approach for Solving Parity Game
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Algorithms for Solving Infinite Games
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Communication complexity of stochastic games
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Linear Complementarity Algorithms for Infinite Games
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
| Hi-index | 0.00 |
We show that the problem of finding optimal strategies for both players in a simple stochastic game reduces to the generalized linear complementarity problem (GLCP) with a P-matrix, a well-studied problem whose hardness would imply NP = co–NP. This makes the rich GLCP theory and numerous existing algorithms available for simple stochastic games. As a special case, we get a reduction from binary simple stochastic games to the P-matrix linear complementarity problem (LCP).