Dynamic programming with value convexity
From MaRDI portal
Publication:2665320
DOI10.1016/J.AUTOMATICA.2021.109641zbMath1486.90205OpenAlexW3153232464MaRDI QIDQ2665320
Publication date: 19 November 2021
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2021.109641
Discrete-time Markov processes on general state spaces (60J05) Dynamic programming in optimal control and differential games (49L20) Discrete-time control/observation systems (93C55) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Risk-averse dynamic programming for Markov decision processes
- Recursive smooth ambiguity preferences
- Convex dynamic programming with (bounded) recursive utility
- Stochastic optimal growth model with risk sensitive preferences
- Probabilistically distorted risk-sensitive infinite-horizon dynamic programming
- Unique solutions for stochastic recursive utilities
- Minimizing the Probability of Lifetime Ruin Under Ambiguity Aversion
- Ambiguity, Learning, and Asset Returns
- Risk-Sensitive Markov Control Processes
- Optimal Structural Policies for Ambiguity and Risk Averse Inventory and Pricing Models
- Fixed points of increasing operators in ordered Banach spaces and applications
- Identifying Long-Run Risks: A Bayesian Mixed-Frequency Approach
- Substitution, Risk Aversion, and the Temporal Behavior of Consumption and Asset Returns: A Theoretical Framework
- Infinite Horizon Risk Sensitive Control of Discrete Time Markov Processes under Minorization Property
This page was built for publication: Dynamic programming with value convexity