Bounds and Transformations for Discounted Finite Markov Decision Chains
From MaRDI portal
Publication:4085522
DOI10.1287/opre.23.4.761zbMath0322.90073OpenAlexW1983920151MaRDI QIDQ4085522
Publication date: 1975
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.23.4.761
Markov and semi-Markov decision processes (90C40) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Mathematical programming (90C99) Hamilton-Jacobi theories (49L99)
Related Items
Approximating Markov decision processes using expected state transitions ⋮ Computation techniques for large scale undiscounted markov decision processes ⋮ Computational comparison of policy iteration algorithms for discounted Markov decision processes ⋮ Approximate dynamic programming with state aggregation applied to UAV perimeter patrol ⋮ Block-scaling of value-iteration for discounted Markov renewal programming ⋮ Generic rank-one corrections for value iteration in Markovian decision problems ⋮ On efficiency of linear programming applied to discounted Markovian decision problems ⋮ The numerical exploitation of periodicity in Markov decision processes ⋮ 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 ⋮ Markov renewal decision processes with finite horizon ⋮ Conditions for characterizing the structure of optimal strategies in infinite-horizon dynamic programs ⋮ Action-dependent stopping times and Markov decision process with unbounded rewards ⋮ A multi-period TSP with stochastic regular and urgent demands ⋮ Markov decision processes ⋮ Value function approximation via linear programming for FMS scheduling ⋮ Discounted Markov games; successive approximation and stopping times ⋮ 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 ⋮ Computational comparison of value iteration algorithms for discounted Markov decision processes ⋮ Generalized polynomial approximations in Markovian decision processes
