Finding Best k Policies

DOI10.1007/978-3-642-04428-1_13zbMath1260.68382OpenAlexW1521420575MaRDI QIDQ3645312

Peng Dai, Judy 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) Decision theory (91B06) Markov and semi-Markov decision processes (90C40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Related Items (1)

Ranking policies in discrete Markov decision processes

This page was built for publication: Finding Best k Policies