Home /Research /On the complexity of finite memory policies for Markov decision processes
OTHER

On the complexity of finite memory policies for Markov decision processes

Danièle Beauquier, Dima Burago, Anatol Slissenko

Year
1995
Citations
9

Keywords

Markov decision processProbabilistic logicComputer scienceClass (philosophy)Markov processPartially observable Markov decision processMathematical optimizationDecision problemTheoretical computer scienceMathematical economics

Related papers

Browse all OTHER papers