scientific article; zbMATH DE number 1786117

zbMATH Open1008.90068MaRDI QIDQ4547437FDOQ4547437

Authors: Linn I. Sennott 

Publication date: 21 August 2002

Title of this publication is not available (Why is that?)

Recommendations

• Existence of optimal stationary policies in average reward Markov decision processes with a recurrent state
• Average Optimality in Dynamic Programming with General State Space
• scientific article; zbMATH DE number 94713
• Average, Sensitive and Blackwell Optimal Policies in Denumerable Markov Decision Chains with Unbounded Rewards
• An expected average reward criterion

zbMATH Keywords

average reward optimalitymathematical complexity

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Markov and semi-Markov decision processes (90C40)

Cited In (7)

• A Weighted Markov Decision Process
• A semimartingale characterization of average optimal stationary policies for Markov decision processes
• The Optimal Reward Operator in Negative Dynamic Programming
• Another set of conditions for Markov decision processes with average sample-path costs
• Sample-path optimality and variance-maximization for Markov decision processes
• Average optimality for Markov decision processes in borel spaces: a new condition and approach
• Another set of verifiable conditions for average Markov decision processes with Borel spaces.

This page was built for publication:

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