Some Bounds for Discounted Sequential Decision Processes
From MaRDI portal
Publication:5640967
DOI10.1287/mnsc.18.1.7zbMath0232.90004OpenAlexW2116637980MaRDI QIDQ5640967
Publication date: 1971
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.18.1.7
Related Items
Variational characterizations in Markov decision processes, Computation techniques for large scale undiscounted markov decision processes, Serial and parallel value iteration algorithms for discounted Markov decision processes, An Heuristic for Multi-Dimensional Markov Decision Processes, Block-scaling of value-iteration for discounted Markov renewal programming, Replacement process decomposition for discounted Markov renewal programming, Some basic concepts of numerical treatment of Markov decision models, (Approximate) iterated successive approximations algorithm for sequential decision processes, Error bounds for stochastic shortest path problems, Nonstationary Markov decision problems with converging parameters, The method of value oriented successive approximations for the average reward Markov decision process, Bounds for the renewal function, Conditions for characterizing the structure of optimal strategies in infinite-horizon dynamic programs, A natural extension of the MacQueen extrapolation, Markov decision processes, A decision exclusion algorithm for a class of Markovian Decision Processes, A set of successive approximation methods for discounted Markovian decision problems, Block-successive approximation for a discounted Markov decision model, Using adaptive learning in credit scoring to estimate take-up probability distribution, Estimates for finite-stage dynamic programs, Bounds on the fixed point of a monotone contraction operator, Discounted Markov games: Generalized policy iteration method, Solving infinite horizon discounted Markov decision process problems for a range of discount factors, Discounted Markov games; successive approximation and stopping times, Contraction mappings underlying undiscounted Markov decision problems, A superharmonic approach to solving infinite horizon partially observable Markov decision problems, Improved iterative computation of the expected discounted return in Markov and semi-Markov chains, A \(K\)-step look-ahead analysis of value iteration algorithms for Markov decision processes, A method of bisection for discounted Markov decision problems, Computational comparison of value iteration algorithms for discounted Markov decision processes, MARKOV DECISION PROCESSES, Zur Extrapolation in Markoffschen Entscheidungsmodellen mit Diskontierung
