Algorithms for solution of a class of stochastic games

This paper treats the computational solution of terminating stochastic games using concepts from deterministic matrix games and Markovian decision processes. The algorithms due to Shapley and Pollatschek/ Avi-Itzhak are discussed and a suboptimal approach suitable for large problems is presented. Numerical results are given from an example comparing the three approaches.