Average optimality inequality for continuous-time Markov decision processes in Polish spaces (Q2472191)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Average optimality inequality for continuous-time Markov decision processes in Polish spaces |
scientific article; zbMATH DE number 5237215
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average optimality inequality for continuous-time Markov decision processes in Polish spaces |
scientific article; zbMATH DE number 5237215 |
Statements
Average optimality inequality for continuous-time Markov decision processes in Polish spaces (English)
0 references
20 February 2008
0 references
This paper is concerned with the average cost optimality criterion for continuous-time jump Markov decision processes. Assuming some regularity conditions and exponential uniform ergodicity, the author establishes the optimality inequality by employing a vanishing discount factor approach, Fatou's lemma and Tauberian theorem. An optimal policy is obtained as a measurable selector from this optimality inequality. A similar result for discrete-time Markov decision processes was obtained by \textit{M. Schäl} [Math. Oper. Res. 18, No. 1, 163--172 (1993; Zbl 0777.90079)].
0 references
optimal policy
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9275514483451844
0 references
0.8878118991851807
0 references
0.8797946572303772
0 references
0.8750419616699219
0 references