Simulation-based algorithms for Markov decision processes.
From MaRDI portal
Recommendations
Cited in
(36)- A survey of some simulation-based algorithms for Markov decision processes
- Sampled fictitious play for approximate dynamic programming
- NDP methods for multi-chain MDPs
- Approximation of Markov decision processes with general state space
- CONIC TRADING IN A MARKOVIAN STEADY STATE
- Computable approximations for average Markov decision processes in continuous time
- Sleeping experts and bandits approach to constrained Markov decision processes
- Policy-based branch-and-bound for infinite-horizon multi-model Markov decision processes
- An Adaptive Sampling Algorithm for Solving Markov Decision Processes
- An evolutionary random policy search algorithm for solving Markov decision processes
- Variance-penalized Markov decision processes: dynamic programming and reinforcement learning techniques
- A review of stochastic algorithms with continuous value function approximation and some new approximate policy iteration algorithms for multidimensional continuous applications
- Approximate policy iteration: a survey and some new methods
- Adaptive aggregation for reinforcement learning in average reward Markov decision processes
- Simulation optimization algorithms for SMDPs with parameterized randomized stationary policies
- The optimal control of just-in-time-based production and distribution systems and performance comparisons with optimized pull systems
- Simulation-based optimization of Markov reward processes
- Strategic capacity decision-making in a stochastic manufacturing environment using real-time approximate dynamic programming
- Simulation-based optimization of Markov decision processes: an empirical process theory approach
- Planning with Markov decision processes. An AI perspective
- A variable neighborhood search based algorithm for finite-horizon Markov decision processes
- Computable approximations for continuous-time Markov decision processes on Borel spaces based on empirical measures
- Risk-Sensitive Reinforcement Learning via Policy Gradient Search
- What you should know about approximate dynamic programming
- Approximate stochastic annealing for online control of infinite horizon Markov decision processes
- Mean field Markov decision processes
- Coupling based estimation approaches for the average reward performance potential in Markov chains
- New approximate dynamic programming algorithms for large-scale undiscounted Markov decision processes and their application to optimize a production and distribution system
- Multi-policy iteration with a distributed voting.
- Simulation-based algorithms for Markov decision processes
- Optimization of Markov decision processes under the variance criterion
- Approximation of discounted minimax Markov control problems and zero-sum Markov games using Hausdorff and Wasserstein distances
- Stochastic approximations of constrained discounted Markov decision processes
- Computing optimal policies for Markovian decision processes using simulation
- A \(Sarsa(\lambda)\) algorithm based on double-layer fuzzy reasoning
- Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm
This page was built for publication: Simulation-based algorithms for Markov decision processes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870662)
