Strong \(n\)-discount and finite-horizon optimality for continuous-time Markov decision processes
From MaRDI portal
Publication:890634
DOI10.1007/s11424-014-1277-zzbMath1327.93424OpenAlexW2025607623MaRDI QIDQ890634
Publication date: 10 November 2015
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-014-1277-z
Polish spacecontinuous-time Markov decision processexpected average reward criterionfinite-horizon optimalitystrong \(n\)-discount optimality
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of recent results on continuous-time Markov decision processes (with comments and rejoinder)
- Average optimality for continuous-time Markov decision processes in Polish spaces
- The relations among potentials, perturbation analysis, and Markov decision processes
- Bias optimality versus strong 0-discount optimality in Markov control processes with unbounded costs
- The Laurent series, sensitive discount and Blackwell optimality for continuous-time controlled Markov chains
- Sensitive discount optimality in controlled one-dimensional diffusions
- Computable exponential convergence rates for stochastically ordered Markov processes
- Average optimality for continuous-time Markov decision processes with a policy iteration approach
- Average optimality inequality for continuous-time Markov decision processes in Polish spaces
- Bias Optimality for Continuous-Time Controlled Markov Chains
- Markov Decision Processes with Variance Minimization: A New Condition and Approach
- Bias and Overtaking Optimality for Continuous-Time Jump Markov Decision Processes in Polish Spaces
- Ergodic Control, Bias, and Sensitive Discount Optimality for Markov Diffusion Processes
- Perturbation realization, potentials, and sensitivity analysis of Markov processes
- A note on bias optimality in controlled queueing systems
- A note on optimality conditions for continuous-time Markov decision processes with average cost criterion
- Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey
- Strong 0-discount optimal policies in a Markov decision process with a Borel state space
- Sample-Path Optimality and Variance-Minimization of Average Cost Markov Control Processes
- Blackwell Optimality for Controlled Diffusion Processes
- Continuous-Time Markov Decision Processes with Discounted Rewards: The Case of Polish Spaces
- On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting
- Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
- Another Set of Conditions for Strongn(n = −1, 0) Discount Optimality in Markov Decision Processes
