On Finding the Maximal Gain for Markov Decision Processes

Amedeo R. Odoni
Additional contact information
Amedeo R. Odoni: Massachusetts Institute of Technology, Cambridge, Massachusetts

Operations Research, 1969, vol. 17, issue 5, 857-860

Abstract: The method of successive approximations for solving problems on single-chain Markovian decision processes has been investigated by White and Schweitzer. This paper shows that White's scheme not only converges, but also can be modified so that monotonic upper and lower bounds on the maximal gain can be obtained.

Date: 1969
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.5.857 (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:oropre:v:17:y:1969:i:5:p:857-860

Access Statistics for this article

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