Vertical linear complementarity and discounted zero-sum stochastic games with ARAT structure

In this paper we consider a two-person zero-sum discounted stochastic game with ARAT structure and formulate the problem of computing a pair of pure optimal stationary strategies and the corresponding value vector of such a game as a vertical linear complementarity problem. We show that Cottle-Dantzig’s algorithm (a generalization of Lemke’s algorithm) can solve this problem under a mild assumption. Received July 8, 1998 / Revised version received April 16, 1999? Published online September 15, 1999