Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-28T01:37:33.243Z Has data issue: false hasContentIssue false
  • English
  • Français

Successive approximations for Markov decision processes

Published online by Cambridge University Press:  01 July 2016

J. A. E. E. Van Nunen
J. A. E. E. Van Nunen*
Affiliation:
Graduate School of Management, Delft
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
II. Contributed Papers
Information
Advances in Applied Probability , Volume 10 , Issue 2 , June 1978 , pp. 311 - 312
Copyright
Copyright © Applied Probability Trust 1978 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

D'Épenoux, F. (1960) Sur un problème de productions et de stockage dans l'aléatoire. Rev. Fr. Rech. Opér. 14, 13–16.Google Scholar
Hastings, N. A. J. (1968) Some notes on dynamic programming and replacement. Operat. Res. Quart. 19, 453–464.Google Scholar
Howard, R. A. (1960) Dynamic Programming and Markov Processes. MIT Press, Cambridge, Mass.Google Scholar
Reetz, D. (1973) Solutions of a Markov decision process by successive overrelaxation. Z. Opns. Res. 21, 29–32.Google Scholar
Van Nunen, J. A. E. E. (1976) Contracting Markov Decision Processes. Mathematical Centre Tracts No. 71, Amsterdam.Google Scholar