Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor

Abstract

Ye showed recently that the simplex method with Dantzig pivoting rule, as well as Howard's policy iteration algorithm, solve discounted Markov decision processes (MDPs), with a constant discount factor, in strongly polynomial time. More precisely, Ye showed that both algorithms terminate after at most $O(\frac{mn}{1-\gamma }\log (\frac{n}{1-\gamma }))$ iterations, where $n$ is the number of states, $m$ is the total number of actions in the MDP, and $0<\gamma <1$ is the discount factor. We improve Ye's analysis in two respects. First, we improve the bound given by Ye and show that Howard's policy iteration algorithm actually terminates after at most $O(\frac{m}{1-\gamma }\log (\frac{n}{1-\gamma }))$ iterations. Second, and more importantly, we show that the same bound applies to the number of iterations performed by the strategy iteration (or strategy improvement) algorithm, a generalization of Howard's policy iteration algorithm used for solving 2-player turn-based stochastic games with discounted zero-sum rewards. This provides the first strongly polynomial algorithm for solving these games, resolving a long standing open problem.

Cited by in corpus (7)

• Log-sum-exp neural networks and posynomial models for convex and log-log-convex data
• The operator approach to entropy games
• Policy iteration for perfect information stochastic mean payoff games with bounded first return times is strongly polynomial
• The greedy strategy in optimizing the Perron eigenvalue
• Policy Iteration is well suited to optimize PageRank
• Efficient Computation of a Canonical Form for a Generalized P-matrix
• A non-iterative algorithm for generalized Pig games