Pointwise and Uniformly Good Stationary Strategies for Dynamic Programming Models

DOI10.1287/MOOR.11.3.521MaRDI QIDQ3754452zbMATH OpenOpenAlexFDO

Authors R. van Dawen

Publication date 1986

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.11.3.521

zbMATH Keywords

total reward criteriondiscrete time countable state Markovian decision problemsexistence of pointwise good stationary strategies

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40)

Recommendations

• scientific article; zbMATH DE number 3845370
• The existence of good Markov strategies for decision processes with general payoffs
• scientific article; zbMATH DE number 3847226
• scientific article; zbMATH DE number 3978861
• scientific article; zbMATH DE number 3922401

Cited in

(11)

• Continuous time markov decision processes with nonuniformly bounded transition rate: expected total rewards
• Stationary Policies in Dynamic Programming Models Under Compactness Assumptions
• The existence of good Markov strategies for decision processes with general payoffs
• scientific article; zbMATH DE number 3978861 (Why is no real title available?)
• Finite state dynamic programming with the total reward criterion
• On Stationary Strategies in Countable State Total Reward Markov Decision Processes
• scientific article; zbMATH DE number 4074840 (Why is no real title available?)
• On a reduction principle in dynamic programming
• Limit-optimal strategies in countable state decision problems
• Analysis for some properties of discrete time Markov decision processes
• scientific article; zbMATH DE number 3845370 (Why is no real title available?)

This page was built for publication: Pointwise and Uniformly Good Stationary Strategies for Dynamic Programming Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3754452)