Finite state Markov decision models with average reward criteria
This paper deals with a discrete time Markov decision model with a finite state space, arbitrary action space, and bounded reward function under the average reward criteria. We consider four average reward criteria and prove the existence of persistently nearly optimal strategies in various classes of strategies for models with complete state information. We show that such strategies exist in any class of strategies satisfying the following condition: along any trajectory at different epochs the controller knows different information about the past. Though neither optimal nor stationary nearly optimal strategies may exist, we show that for some nonempty set of states the described nearly optimal strategies may be chosen either stationary or optimal.
Year of publication: |
1994
|
---|---|
Authors: | Feinberg, Eugene A. ; Park, Haechurl |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 49.1994, 1, p. 159-177
|
Publisher: |
Elsevier |
Keywords: | Markov decision models average reward criteria persistently nearly optimal strategies Markov strategies stationary strategies non-repeating condition |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Establishing dominance between strategies with interval judgments of state probabilities
Ahn, Byeong Seok, (2014)
-
Establishing dominance between strategies with interval judgments of state probabilities
Ahn, Byeong Seok, (2014)
-
Quickest detection of drift change for Brownian motion in generalized Bayesian and minimax settings
Feinberg, Eugene A., (2006)
- More ...