On the complexity of finite memory policies for Markov decision processes
From MaRDI portal
Publication:3569011
DOI10.1007/3-540-60246-1_125zbMath1193.68126MaRDI 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
68Q25: Analysis of algorithms and problem complexity
90C40: Markov and semi-Markov decision processes
Related Items
On probabilistic timed automata., A mean-variance optimization problem for discounted Markov decision processes