A perturbation approach to a class of discounted approximate value iteration algorithms with Borel spaces
From MaRDI portal
Publication:330284
DOI10.3934/jdg.2016014zbMath1346.93402OpenAlexW2507723477MaRDI QIDQ330284
Óscar Vega-Amaya, Joaquín López-Borbón
Publication date: 25 October 2016
Published in: Journal of Dynamics and Games (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jdg.2016014
Approximation methods and heuristics in mathematical programming (90C59) Optimal stochastic control (93E20) Markov and semi-Markov decision processes (90C40)
Related Items (2)
Approximation of discounted minimax Markov control problems and zero-sum Markov games using Hausdorff and Wasserstein distances ⋮ A perturbation approach to approximate value iteration for average cost Markov decision processes with Borel spaces and bounded costs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perspectives of approximate dynamic programming
- Approximate dynamic programming via direct search in the space of value function approximations
- Continuous state dynamic programming via nonexpansive approximation
- Application of average dynamic programming to inventory systems
- The approximation of continuous functions by positive linear operators
- On the existence of fixed points for approximate value iteration and temporal-difference learning
- Adaptive Markov control processes
- A survey of Markov decision models for control of networks of queues
- An Approximate Dynamic Programming Algorithm for Monotone Value Functions
- Approximate policy iteration: a survey and some new methods
- A review of stochastic algorithms with continuous value function approximation and some new approximate policy iteration algorithms for multidimensional continuous applications
- Approximate Fixed Point Iteration with an Application to Infinite Horizon Markov Decision Processes
- A Survey of Applications of Markov Decision Processes
- Approximation of Infinite Horizon Discounted Cost Markov Decision Processes
- Approximate Dynamic Programming
- Performance Loss Bounds for Approximate Value Iteration with State Aggregation
- Performance Bounds in $L_p$‐norm for Approximate Value Iteration
This page was built for publication: A perturbation approach to a class of discounted approximate value iteration algorithms with Borel spaces