Average optimality inequality for continuous-time Markov decision processes in Polish spaces (Q2472191): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00186-007-0157-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2049605645 / rank | |||
Normal rank |
Revision as of 21:27, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Average optimality inequality for continuous-time Markov decision processes in Polish spaces |
scientific article |
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