Sensitive Optimality Criteria in Countable State Dynamic Programming
- Resource Type
- research-article
- Authors
- Hordijk, A.; Sladký, K.
- Source
- Mathematics of Operations Research, 1977 Feb 01. 2(1), 1-14.
- Subject
- Markov decision processes
Discrete time
Countable state space
Equivalence sensitive optimality criteria
Liapunov function criterion
Dynamic programming
Mathematical vectors
Expected returns
Markov processes
Optimal policy
Matrices
Interest rates
Mathematical theorems
Markov chains
- Language
- English
- ISSN
- 0364765X
15265471
Discrete time Markov decision processes with a countable state space are investigated. Under a condition of Liapunov function type the Laurent expansion of the total discounted expected return for the various policies is derived. Moreover, the equivalence of the sensitive optimality criteria as introduced by Veinott is shown.