Non-Discounted Denumerable Markovian Decision Models

From MaRDI portal
Revision as of 03:28, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5540144

DOI10.1214/aoms/1177698405zbMath0157.50504OpenAlexW2083661550MaRDI QIDQ5540144

Sheldon M. Ross

Publication date: 1968

Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoms/1177698405




Related Items (21)

A new condition for the existence of optimal stationary policies in average cost Markov decision processesA finite step algorithm via a bimatrix game to a single controller non- zero sum stochastic gameAverage Cost Markov Decision Processes with Weakly Continuous Transition ProbabilitiesStrong 0-discount optimal policies in a Markov decision process with a Borel state spaceReduction of total-cost and average-cost MDPs with weakly continuous transition probabilities to discounted mdpsOn optimality criteria for dynamic programs with long finite horizonsInvariant problems in dynamic programming - average reward criterionStrong polynomiality of policy iterations for average-cost MDPs modeling replacement and maintenance problemsDenumerable semi-Markov decision chains with small interest ratesWhat do discounted optima converge to!: A theory of discount rate asymptotics in economic modelsA note on the vanishing interest rate approach in average Markov decision chains with continuous and bounded costsDiscounted and average Markov decision processes with unbounded rewards: New conditionsA survey of maintenance models: The control and surveillance of deteriorating systemsAn application of Markov potential theory to Markovian decision processesContinuous time control of Markov processes on an arbitrary state space: average return criterionSolving stochastic dynamic programming problems by linear programming — An annotated bibliographyFinite-state approximations to denumerable-state dynamic programsOptimal control of stationary Markov processesOn the reduction of total‐cost and average‐cost MDPs to discounted MDPsDenumerable state nonhomogeneous Markov decision processesUndiscounted approximations of discounted regenerative models






This page was built for publication: Non-Discounted Denumerable Markovian Decision Models