Ranking policies in discrete Markov decision processes

DOI10.1007/s10472-010-9216-8zbMath1206.90207OpenAlexW2010356296WikidataQ113444966 ScholiaQ113444966MaRDI QIDQ622592

Judy Goldsmith, Peng Dai

Publication date: 3 February 2011

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-010-9216-8

zbMATH Keywords

Markov decision processprobabilistic planningpolicy ranking

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the \(K\) shortest hyperpaths
• Finding the \(K\) best policies in a finite-horizon Markov decision process
• Finding Best k Policies
• On the Speed of Convergence of Value Iteration on Stochastic Shortest-Path Problems

This page was built for publication: Ranking policies in discrete Markov decision processes