On the complexity of finite memory policies for Markov decision processes

DOI10.1007/3-540-60246-1_125zbMath1193.68126OpenAlexW1505198957MaRDI QIDQ3569011

Dmitri Burago, Danièle Beauquier, Anatol Slissenko

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60246-1_125

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Markov and semi-Markov decision processes (90C40)

Related Items (2)

A mean-variance optimization problem for discounted Markov decision processes ⋮ On probabilistic timed automata.

This page was built for publication: On the complexity of finite memory policies for Markov decision processes