Publication:3483104

zbMath0703.90091MaRDI QIDQ3483104

Martin L. Puterman

Publication date: 1990

zbMATH Keywords

survey; infinite horizon; Bellman equation; computational methods; stochastic dynamic programming; policy iteration; value iteration; continuous-time; long run average reward; expected discounted reward; expected total reward; semi- Markov decision processes; stochastic, sequential decision processes

Mathematics Subject Classification ID

90C05: Linear programming

90C15: Stochastic programming

93C55: Discrete-time control/observation systems

90C39: Dynamic programming

90C40: Markov and semi-Markov decision processes

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Methods and applications of (max,+) linear algebra, Asymptotic analysis for multi-objective sequential stochastic assignment problems, Statistical model checking of stochastic component-based systems, Smooth dynamics and computation in models of economic growth, On the Complexity of Reachability in Parametric Markov Decision Processes, Index policy for multiarmed bandit problem with dynamic risk measures, Policy iteration and Newton-Raphson methods for Markov decision processes under average cost criterion, Optimal maintenance policies in random environments, The independent choice logic for modelling multiple agents under uncertainty, Optimal strategies for an inventory system with cost functions of general form, Optimal policies under risk for changing software systems based on customer satisfaction, Reformulation of the linear program for completely ergodic MDPs with average cost criteria, A novel scheduling index rule proposal for QoE maximization in wireless networks, Online scheduling for outpatient services with heterogeneous patients and physicians, On probabilistic timed automata., On satisficing in quantitative games, An application of approximate dynamic programming in multi-period multi-product advertising budgeting, Policies for the dynamic traveling maintainer problem with alerts, Exact finite approximations of average-cost countable Markov decision processes