Linear Complementarity and P-Matrices for Stochastic Games

Abstract. We define the first nontrivial polynomially recognizable subclass of P-matrix Generalized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No such classes/rules were previously known. We show that a subclass of Shapley turn-based stochastic games, subsuming Condon's simple stochastic games, is reducible to the new class of GLCPs. Based on this we suggest the new strongly subexponential combinatorial algorithms for these games.

• Type: Conference
• Year: 2006
• Where: ERSHOV
• Authors: Ola Svensson, Sergei G. Vorobyov
• Keywords: ERSHOV 2006, Recognizable Subclass, Stochastic Games, Theoretical Computer Science, Turn-based Stochastic Games