Bias optimality for multichain continuous-time Markov decision processes
From MaRDI portal
Publication:1038097
DOI10.1016/j.orl.2009.04.005zbMath1173.90579OpenAlexW2081234223MaRDI QIDQ1038097
Xianping Guo, Junyu Zhang, Xin-Yuan Song
Publication date: 17 November 2009
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2009.04.005
policy iterationcontinuous-time Markov decision processbias optimalitydifference formulamultichain model
Related Items (2)
Continuous-time Markov decision processes with \(n\)th-bias optimality criteria ⋮ Optimality of admission control in a repairable queue
Cites Work
- Unnamed Item
- Unnamed Item
- A unified approach to Markov decision problems and performance sensitivity analysis with discounted and average criteria: multichain cases
- A survey of recent results on continuous-time Markov decision processes (with comments and rejoinder)
- Optimal control of diffusion processes with reflection
- Finite state continuous time Markov decision processes with an infinite planning horizon
- Bias Optimality for Continuous-Time Controlled Markov Chains
- ADMISSION CONTROL WITH INCOMPLETE INFORMATION TO A FINITE BUFFER QUEUE
- Bias Optimality in Controlled Queueing Systems
- A probabilistic analysis of bias optimality in unichain Markov decision processes
- The $n$th-Order Bias Optimality for Multichain Markov Decision Processes
- Nondiscounted Continuous Time Markovian Decision Process with Countable State Space
- Constrained Optimization for Average Cost Continuous-Time Markov Decision Processes
- On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting
- Handbook of Markov decision processes. Methods and applications
This page was built for publication: Bias optimality for multichain continuous-time Markov decision processes