Successive approximation algorithms for stochastic games-Numerical comparisons

Abstract

In this paper we treat algorithmic methods for solution of stochastic games. A value iteration method incorporating bounds in a test for suboptimality is compared with policy iteration for three types of transition probability matrices. Numerical experiments demonstrate the superiority of the value iteration technique for problems with special structure.