On the relative value iteration with a risk-sensitive criterion
Not on the map. Why?
Abstract (arXiv)
A multiplicative relative value iteration algorithm for solving the dynamic programming equation for the risk-sensitive control problem is studied for discrete time controlled Markov chains with a compact Polish state space, and controlled diffusions in on the whole Euclidean space. The main result is a proof of convergence to the desired limit in each case.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 18 Dec 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025Planning and Learning in Average Risk-aware MDPscited by 2
- 2025Planning and Learning in Average Risk-aware MDPs22 Mar 2025