Finding Best k Policies

DOI10.1007/978-3-642-04428-1_13MaRDI QIDQ3645312zbMATH OpenOpenAlexFDO

Authors Peng Dai, J. Goldsmith

Publication date 17 November 2009

Published in Algorithmic Decision Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04428-1_13

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Markov and semi-Markov decision processes (90C40) Decision theory (91B06)

Recommendations

• Ranking policies in discrete Markov decision processes
• On functional equations for \(K\)th best policies in Markov decision processes
• Finding the \(K\) best policies in a finite-horizon Markov decision process
• FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION
• Searching for the m best solutions in graphical models

Cited in

(3)

• Finding the \(K\) best policies in a finite-horizon Markov decision process
• Ranking policies in discrete Markov decision processes
• Flexible risk aware sequential decision making

This page was built for publication: Finding Best k Policies

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