Hostname: page-component-7dd5485656-tbj44 Total loading time: 0 Render date: 2025-10-30T14:11:23.222Z Has data issue: false hasContentIssue false
  • English
  • Français

The asymptotic behaviour of the minimal total expected cost for the denumerable state Markov decision model

Published online by Cambridge University Press:  14 July 2016

Arie Hordijk ,
Paul J. Schweitzer  and
Henk Tijms
Arie Hordijk
Affiliation:
Mathematisch Centrum, Amsterdam
Paul J. Schweitzer
Affiliation:
IBM Thomas J. Watson Research Center, Yorktown Heights, New York
Henk Tijms
Affiliation:
Mathematisch Centrum, Amsterdam
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper considers the discrete time Markov decision model with a denumerable state space and finite action space. Under certain conditions it is proved that the minimal total expected cost for a planning horizon of n epochs minus n times the minimal long-run average expected cost per unit time has a finite limit as n → ∞ for each initial state.

Keywords

MARKOV DECISION THEORYDENUMERABLE STATE SPACEMINIMAL AVERAGE COSTMINIMAL TOTAL COSTLIMITING BEHAVIOUR

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 12 , Issue 2 , June 1975 , pp. 298 - 305
Copyright
Copyright © Applied Probability Trust 1975 

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.)

Article purchase

Temporarily unavailable

References

Bather, J. (1973) Optimal decision procedures for finite Markov chains. Part II: Communicating systems. Adv. Appl. Prob. 5, 521–540.Google Scholar
Brown, B. W. (1965) On the iterative method of dynamic programming on a finite space discrete time Markov process. Ann. Math. Statist. 36, 1279–1285.Google Scholar
Chung, K. L. (1960) Markov Chains with Stationary Transition Probabilities. Springer-Verlag, Berlin.Google Scholar
Denardo, E. V. (1973) A Markov decision problem. In Mathematical Programming , by Hu, T. C. and Robinson, S. M. Academic Press, New York.Google Scholar
Hordijk, A. and Tijms, H. C. (1974) Convergence results and approximations for optimal (S, S) policies. Management Sci. 20, 1432–1438.Google Scholar
Lanery, E. (1967) Etude asymptotique des systèmes Markoviens à commande. Rev. Informat. Recherche Opérationelle 3, 3–56.Google Scholar
Lembersky, M. R. (1973) On maximal rewards and e-optimal policies in continuous time Markov decision chains. Ann. Statist. 2, 159–169.Google Scholar
Ross, S. M. (1968) Arbitrary state Markovian decision processes. Ann. Math. Statist. 39, 2118–2122.Google Scholar
Royden, H. (1968) Real Analysis (2nd. ed.) MacMillan New York.Google Scholar
Schweitzer, P. J. (1965) Perturbation theory and Markovian decision processes. Technical Report No. 15, Operations Research Center, M. I. T., Cambridge, Massachusetts.Google Scholar
Schweitzer, P. J. (1969) Perturbation theory and undiscounted Markov renewal programming. Operations Res. 17, 716–727.Google Scholar
Schweitzer, P. J. (1974) Asymptotic convergence of undiscounted value iteration. To appear.Google Scholar