A modified dynamic programming method for Markovian decision problems
From MaRDI portal
Publication:2522486
DOI10.1016/0022-247X(66)90060-6zbMath0141.17203MaRDI QIDQ2522486
Publication date: 1966
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Related Items (38)
Variational characterizations in Markov decision processes ⋮ Computation techniques for large scale undiscounted markov decision processes ⋮ The value of real time yield information in multi-stage inventory systems -- exact and heuristic approaches ⋮ Approximate dynamic programming with state aggregation applied to UAV perimeter patrol ⋮ Block-scaling of value-iteration for discounted Markov renewal programming ⋮ Replacement process decomposition for discounted Markov renewal programming ⋮ Generic rank-one corrections for value iteration in Markovian decision problems ⋮ Accelerated modified policy iteration algorithms for Markov decision processes ⋮ Unnamed Item ⋮ Some basic concepts of numerical treatment of Markov decision models ⋮ On optimal dividend payments and related problems ⋮ Error bounds for stochastic shortest path problems ⋮ On theory and algorithms for Markov decision problems with the total reward criterion ⋮ Solving linear systems by methods based on a probabilistic interpretation ⋮ State partitioning based linear program for stochastic dynamic programs: an invariance property ⋮ Second order bounds for Markov decision processes ⋮ A natural extension of the MacQueen extrapolation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Strategic capacity decision-making in a stochastic manufacturing environment using real-time approximate dynamic programming ⋮ The capital cost of holding inventory with stochastically mean-reverting purchase price ⋮ On Markov games ⋮ Markov decision processes ⋮ A set of successive approximation methods for discounted Markovian decision problems ⋮ 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 ⋮ Markov programming by successive approximations with respect to weighted supremum norms ⋮ Discounted Markov games; successive approximation and stopping times ⋮ Contraction mappings underlying undiscounted Markov decision problems ⋮ Improved iterative computation of the expected discounted return in Markov and semi-Markov chains ⋮ Numerical aspects in Bayesian inventory control ⋮ A method of bisection for discounted Markov decision problems ⋮ An aggregation-based approximate dynamic programming approach for the periodic review model with random yield ⋮ MARKOV DECISION PROCESSES ⋮ Generalized polynomial approximations in Markovian decision processes ⋮ Zur Extrapolation in Markoffschen Entscheidungsmodellen mit Diskontierung
Cites Work
This page was built for publication: A modified dynamic programming method for Markovian decision problems
