Approximation of Markov decision processes with general state space
From MaRDI portal
Publication:663675
DOI10.1016/j.jmaa.2011.11.015zbMath1232.90342MaRDI QIDQ663675
Tomás Prieto-Rumeau, François Dufour
Publication date: 27 February 2012
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2011.11.015
65K05: Numerical mathematical programming methods
60J25: Continuous-time Markov processes on general state spaces
90B90: Case-oriented studies in operations research
90C40: Markov and semi-Markov decision processes
Related Items
From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming, Computable approximations for average Markov decision processes in continuous time, Unnamed Item, Nonasymptotic Analysis of Monte Carlo Tree Search, On Finite Approximations to Markov Decision Processes with Recursive and Nonlinear Discounting, A perturbation approach to approximate value iteration for average cost Markov decision processes with Borel spaces and bounded costs, Approximation of average cost Markov decision processes using empirical distributions and concentration inequalities, Certified reinforcement learning with logic guidance, Conditions for the solvability of the linear programming formulation for constrained discounted Markov decision processes, Quantitative model-checking of controlled discrete-time Markov processes, A convex optimization approach to dynamic programming in continuous state and action spaces, Near optimality of quantized policies in stochastic control under weak continuity conditions, Approximation of discounted minimax Markov control problems and zero-sum Markov games using Hausdorff and Wasserstein distances, Relevant states and memory in Markov chain bootstrapping and simulation, A stability result for linear Markovian stochastic optimization problems, Stochastic approximations of constrained discounted Markov decision processes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lipschitz continuity of value functions in Markovian decision processes
- Simulation-based algorithms for Markov decision processes.
- Stochastic optimal control. The discrete time case
- Adaptive Markov control processes
- Convergence of Dynamic Programming Models
- Convergence of discretization procedures in dynamic programming
- Approximations of Dynamic Programs, I
- Using Randomization to Break the Curse of Dimensionality
- Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey
- Learning Near-Optimal Policies with Bellman-Residual Minimization Based Fitted Policy Iteration and a Single Sample Path
- Approximate Dynamic Programming