The system will be going down for regular maintenance. Please save your work and logout.
Computable approximations for average Markov decision processes in continuous time
DUFOUR, François
Institut Polytechnique de Bordeaux [Bordeaux INP]
Quality control and dynamic reliability [CQFD]
Institut Polytechnique de Bordeaux [Bordeaux INP]
Quality control and dynamic reliability [CQFD]
DUFOUR, François
Institut Polytechnique de Bordeaux [Bordeaux INP]
Quality control and dynamic reliability [CQFD]
< Reduce
Institut Polytechnique de Bordeaux [Bordeaux INP]
Quality control and dynamic reliability [CQFD]
Language
en
Article de revue
This item was published in
Journal of Applied Probability. 2018-06, vol. 55, n° 02, p. 571-592
Cambridge University press
English Abstract
In this paper we study the numerical approximation of the optimal long-run average cost of a continuous-time Markov decision process, with Borel state and action spaces, and with bounded transition and reward rates. Our ...Read more >
In this paper we study the numerical approximation of the optimal long-run average cost of a continuous-time Markov decision process, with Borel state and action spaces, and with bounded transition and reward rates. Our approach uses a suitable discretization of the state and action spaces to approximate the original control model. The approximation error for the optimal average reward is then bounded by a linear combination of coefficients related to the discretization of the state and action spaces, namely, the Wasserstein distance between an underlying probability measure μ and a measure with finite support, and the Hausdorff distance between the original and the discretized actions sets. When approximating μ with its empirical probability measure we obtain convergence in probability at an exponential rate. An application to a queueing system is presented.Read less <
English Keywords
Continuous-time Markov decision process
Lipschitz continuous control model
Approximation of the optimal value function
Origin
Hal imported