A New Specification of the Multichain Policy Iteration Algorithm in Undiscounted Markov Renewal Programs

Published Online:https://doi.org/10.1287/mnsc.26.12.1211

We consider the Policy Iteration Algorithm for undiscounted Markov Renewal Programs. Previous specifications of the policy evaluation part of this algorithm all required the analysis of the chain structure for each policy generated. The purpose of this paper is to provide a unique specification of the value vectors as well as an anticycling rule which avoids parsing the transition probability matrices into their subchains.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.