Markov decision chains with unbounded costs and applications to the control of queues

Publisher Website
Google Scholar
Abstract
A discrete-time Markov decision model with a denumerable set of states and unbounded costs is considered. It is shown that the optimality equation of dynamic programming along with some additional, easily checked, conditions may be used to establish the optimality or ∊ -optimality of policies with respect to the average expected cost criterion. The results are used to derive optimal policies in two queueing examples.

This publication has 1 reference indexed in Scilit: