ISSN:
1432-5217
Schlagwort(e):
Key words: Markov decision processes
;
expected discounted total rewards
;
optimality equation
;
decomposing the state space
;
eliminating actions.
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Mathematik
,
Wirtschaftswissenschaften
Notizen:
Abstract. This paper studies the discrete time Markov decision processes (MDP) with expected discounted total reward, where the state space is countable, the action space is measurable, the reward function is extended real-valued, and the discount rate may be any real number. Two conditions (GC) and (C) are presented, which are weaker than that presented in literature. By eliminating some worst actions, the state space S can be partitioned into sets S ∞, S −∞, S 0, on which the optimal value function equals +∞ , −∞ or is finite, respectively. Furthermore, the validity of the optimality equation is shown when its right hand side is well defined, especially, when it is restricted to the subset S 0. The reward function r (i, a) is finite and bounded above in a for each i∈S 0. Finally, some sufficient conditions for (GC) and (C) are given.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/s001860050024
Permalink
