State reduction in a Markov decision process

DOI10.1080/002073999287969zbMath1103.90403OpenAlexW2068997845MaRDI QIDQ3150322

Theodore J. Sheskin

Publication date: 17 October 2002

Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/002073999287969

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40)

Related Items (2)

Continue, quit, restart probability model ⋮ A generalized Gittins index for a Markov chain and its recursive calculation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Technical Note—A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities
• Regenerative Analysis and Steady State Distributions for Markov Chains
• Numerical computation of mean passage times and absorption probabilities in Markov and Semi-Markov models
• Computing absorption probabilities for a Markov chain
• Numerical Solution of Linear Equations Arising in Markov Chain Models
• Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems
• Computing mean first passage times for a Markov chain
• Computing the Fundamental Matrix for a Reducible Markov Chain

This page was built for publication: State reduction in a Markov decision process