Pointwise and Uniformly Good Stationary Strategies for Dynamic Programming Models

DOI10.1287/MOOR.11.3.521zbMATH Open0617.90084OpenAlexW2133381850MaRDI QIDQ3754452FDOQ3754452

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

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

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)

Cited In (11)

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

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)