An optimal sequence for sub-Markov decision processes with risk sensitivity
From MaRDI portal
Cites work
- A convex analytic approach to Markov decision processes
- A convex analytic approach to risk-aware Markov decision processes
- A system of Poisson equations for a nonconstant Varadhan functional on a finite state space
- A variational formula for risk-sensitive reward
- Average control of Markov decision processes with Feller transition probabilities and general action spaces
- Average cost Markov decision processes with weakly continuous transition probabilities
- Average optimality for risk-sensitive control with general state space
- Characterization of the optimal risk-sensitive average cost in denumerable Markov decision chains
- Contractive Approximations for the Varadhan's Function on a Finite Markov Chain
- Depth-First Search and Linear Graph Algorithms
- Discounted approximations for risk-sensitive average criteria in Markov decision chains with finite state space
- Discounted approximations in risk-sensitive average Markov cost chains with finite state space
- scientific article; zbMATH DE number 3128787 (Why is no real title available?)
- scientific article; zbMATH DE number 4154239 (Why is no real title available?)
- scientific article; zbMATH DE number 1786117 (Why is no real title available?)
- scientific article; zbMATH DE number 1786123 (Why is no real title available?)
- scientific article; zbMATH DE number 792610 (Why is no real title available?)
- Markov decision processes under risk sensitivity: a discount vanishing approach
- Risk-Sensitive Control of Discrete-Time Markov Processes with Infinite Horizon
- Risk-Sensitive Markov Decision Processes
- Risk-Sensitive Optimal Control for Markov Decision Processes with Monotone Cost
- Risk-sensitivity vanishing limit for controlled Markov processes
- Solution to the risk-sensitive average cost optimality equation in a class of Markov decision processes with finite state space
- The discounted method and equivalence of average criteria for risk-sensitive Markov decision processes on Borel spaces
- The theory of dynamic programming
This page was built for publication: An optimal sequence for sub-Markov decision processes with risk sensitivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6910308)