Some Bounds for Discounted Sequential Decision Processes
From MaRDI portal
Publication:5640967
Cited in
(32)- Estimates for finite-stage dynamic programs
- Computation techniques for large scale undiscounted markov decision processes
- A \(K\)-step look-ahead analysis of value iteration algorithms for Markov decision processes
- Nonstationary Markov decision problems with converging parameters
- Bounds on the fixed point of a monotone contraction operator
- Markov decision processes
- MARKOV DECISION PROCESSES
- Solving infinite horizon discounted Markov decision process problems for a range of discount factors
- A superharmonic approach to solving infinite horizon partially observable Markov decision problems
- Discounted Markov games: Generalized policy iteration method
- Improved iterative computation of the expected discounted return in Markov and semi-Markov chains
- Serial and parallel value iteration algorithms for discounted Markov decision processes
- A set of successive approximation methods for discounted Markovian decision problems
- Replacement process decomposition for discounted Markov renewal programming
- (Approximate) iterated successive approximations algorithm for sequential decision processes
- Some basic concepts of numerical treatment of Markov decision models
- Using adaptive learning in credit scoring to estimate take-up probability distribution
- Variational characterizations in Markov decision processes
- Contraction mappings underlying undiscounted Markov decision problems
- Block-scaling of value-iteration for discounted Markov renewal programming
- Block-successive approximation for a discounted Markov decision model
- Computational comparison of value iteration algorithms for discounted Markov decision processes
- A natural extension of the MacQueen extrapolation
- A method of bisection for discounted Markov decision problems
- Zur Extrapolation in Markoffschen Entscheidungsmodellen mit Diskontierung
- An Heuristic for Multi-Dimensional Markov Decision Processes
- A decision exclusion algorithm for a class of Markovian Decision Processes
- Bounds for the renewal function
- Discounted Markov games; successive approximation and stopping times
- Conditions for characterizing the structure of optimal strategies in infinite-horizon dynamic programs
- The method of value oriented successive approximations for the average reward Markov decision process
- Error bounds for stochastic shortest path problems
This page was built for publication: Some Bounds for Discounted Sequential Decision Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5640967)
