Modified Policy Iteration Algorithms for Discounted Markov Decision Problems

In this paper we study a class of modified policy iteration algorithms for solving Markov decision problems. These correspond to performing policy evaluation by successive approximations. We discuss the relationship of these algorithms to Newton-Kantorovich iteration and demonstrate their covergence. We show that all of these algorithms converge at least as quickly as successive approximations and obtain estimates of their rates of convergence. An analysis of the computational requirements of these algorithms suggests that they may be appropriate for solving problems with either large numbers of actions, large numbers of states, sparse transition matrices, or small discount rates. These algorithms are compared to policy iteration, successive approximations, and Gauss-Seidel methods on large randomly generated test problems.

• 저널Management Science · 24(11) · 1127–1137
• 토픽Matrix Theory and Algorithms · Computational Theory and Mathematics
• DOI10.1287/mnsc.24.11.1127
• 저자Martin L. Puterman, Moon Chirl Shin