Issue |
ESAIM: COCV
Volume 28, 2022
|
|
---|---|---|
Article Number | 26 | |
Number of page(s) | 50 | |
DOI | https://doi.org/10.1051/cocv/2022018 | |
Published online | 26 May 2022 |
Ergodic risk-sensitive control of Markov processes on countable state space revisited
Department of Mathematics, Indian Institute of Science Education and Research, Dr. Homi Bhabha Road, Pune 411008, India
* Corresponding author: anup@iiserpune.ac.in
Received:
28
June
2021
Accepted:
27
February
2022
We consider a large family of discrete and continuous time controlled Markov processes and study an ergodic risk-sensitive minimization problem. Under a blanket stability assumption, we provide a complete analysis to this problem. In particular, we establish uniqueness of the value function and verification result for optimal stationary Markov controls, in addition to the existence results. We also revisit this problem under a near-monotonicity condition but without any stability hypothesis. Our results also include policy improvement algorithms both in discrete and continuous time frameworks.
Mathematics Subject Classification: 90C40 / 91B06 / 60J10
Key words: Risk-sensitive control / ergodic cost criterion / stochastic representation / verification result / Markov decision problem / near-monotone cost
© The authors. Published by EDP Sciences, SMAI 2022
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.