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

A. Federgruen and D. Spreen
Additional contact information
A. Federgruen: Columbia University
D. Spreen: Rheinisch-Westfalische Technische Hochschule, Aachen, West Germany

Management Science, 1980, vol. 26, issue 12, 1211-1217

Abstract: 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.

Keywords: dynamic programming: Markov; finite state; dynamic programming: semi-Markov (search for similar items in EconPapers)
Date: 1980
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.26.12.1211 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:26:y:1980:i:12:p:1211-1217

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().