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

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.

• 저널Management Science · 26(12) · 1211–1217
• 토픽Optimization and Search Problems · Computer Networks and Communications
• DOI10.1287/mnsc.26.12.1211
• 저자Awi Federgruen, Dieter Spreen