Denumerable Markov decision chains: sensitive optimality criteria


Article
volume 28, issue 1 pp 185-211.
This publication is part of collection
Related Files
asset icon
(DenumerableSemi_Markov_1991.pdf, 1.3MB)

(publisher's version.url.txt, 36 bytes)

In this paper we investigate denumerable state semi-Markov decision chains with small interest rates. We consider average and Blackwell optimality and allow for multiple closed sets and unbounded immediate rewards. Our analysis uses the existence of a Laurent series expansion for the total discounted rewards and the continuity of its terms. The assumptions are expressed in terms of a weighted supremum norm. Our method is based on an algebraic treatment of Laurent series; it constructs an appropriate linear space with a lexicographic ordering. Using two operators and a positiveness property we establish the existence of bounded solutions to optimality equations. The theory is illustrated with an example of aK-dimensional queueing system. This paper is strongly based on the work of Denardo [11] and Dekker and Hordijk [7]. This research has partially been sponsored by the Netherlands Organization for Scientific Research (NWO).



Keywords


Automatically Extracted Terms
  • f ~ f
  • state
  • decision
  • laurent series expansion
  • assumption
  • policy
  • optimality
  • dekker
  • chain
  • hordijk
  • i ~ e
  • vector
  • policy f
  • series
  • reward
  • blackwell
  • semi-markov
  • laurent
  • solution
  • matrix