On the Complexity of Solving Markov Decision Problems. Littman, M. L., Dean, T. L., & Kaelbling, L. P. ![On the Complexity of Solving Markov Decision Problems [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex Markov decision problems (MDPs) provide the foundations for a number of problems of interest to AI researchers studying automated planning and reinforcement learning. In this paper, we summarize results regarding the complexity of solving MDPs and the running time of MDP solution algorithms. We argue that, although MDPs can be solved efficiently in theory, more study is needed to reveal practical algorithms for solving large problems quickly. To encourage future research, we sketch some alternative methods of analysis that rely on the structure of MDPs.
@article{littmanComplexitySolvingMarkov2013,
archivePrefix = {arXiv},
eprinttype = {arxiv},
eprint = {1302.4971},
primaryClass = {cs},
title = {On the {{Complexity}} of {{Solving Markov Decision Problems}}},
url = {http://arxiv.org/abs/1302.4971},
abstract = {Markov decision problems (MDPs) provide the foundations for a number of problems of interest to AI researchers studying automated planning and reinforcement learning. In this paper, we summarize results regarding the complexity of solving MDPs and the running time of MDP solution algorithms. We argue that, although MDPs can be solved efficiently in theory, more study is needed to reveal practical algorithms for solving large problems quickly. To encourage future research, we sketch some alternative methods of analysis that rely on the structure of MDPs.},
urldate = {2019-01-21},
date = {2013-02-20},
keywords = {Computer Science - Artificial Intelligence},
author = {Littman, Michael L. and Dean, Thomas L. and Kaelbling, Leslie Pack},
file = {/home/dimitri/Nextcloud/Zotero/storage/R6IPHFQW/Littman et al. - 2013 - On the Complexity of Solving Markov Decision Probl.pdf;/home/dimitri/Nextcloud/Zotero/storage/7NDC6AA9/1302.html}
}
Downloads: 0
{"_id":"emsxvhnJPv7oJx6Dx","bibbaseid":"littman-dean-kaelbling-onthecomplexityofsolvingmarkovdecisionproblems","authorIDs":[],"author_short":["Littman, M. L.","Dean, T. L.","Kaelbling, L. P."],"bibdata":{"bibtype":"article","type":"article","archiveprefix":"arXiv","eprinttype":"arxiv","eprint":"1302.4971","primaryclass":"cs","title":"On the Complexity of Solving Markov Decision Problems","url":"http://arxiv.org/abs/1302.4971","abstract":"Markov decision problems (MDPs) provide the foundations for a number of problems of interest to AI researchers studying automated planning and reinforcement learning. In this paper, we summarize results regarding the complexity of solving MDPs and the running time of MDP solution algorithms. We argue that, although MDPs can be solved efficiently in theory, more study is needed to reveal practical algorithms for solving large problems quickly. To encourage future research, we sketch some alternative methods of analysis that rely on the structure of MDPs.","urldate":"2019-01-21","date":"2013-02-20","keywords":"Computer Science - Artificial Intelligence","author":[{"propositions":[],"lastnames":["Littman"],"firstnames":["Michael","L."],"suffixes":[]},{"propositions":[],"lastnames":["Dean"],"firstnames":["Thomas","L."],"suffixes":[]},{"propositions":[],"lastnames":["Kaelbling"],"firstnames":["Leslie","Pack"],"suffixes":[]}],"file":"/home/dimitri/Nextcloud/Zotero/storage/R6IPHFQW/Littman et al. - 2013 - On the Complexity of Solving Markov Decision Probl.pdf;/home/dimitri/Nextcloud/Zotero/storage/7NDC6AA9/1302.html","bibtex":"@article{littmanComplexitySolvingMarkov2013,\n archivePrefix = {arXiv},\n eprinttype = {arxiv},\n eprint = {1302.4971},\n primaryClass = {cs},\n title = {On the {{Complexity}} of {{Solving Markov Decision Problems}}},\n url = {http://arxiv.org/abs/1302.4971},\n abstract = {Markov decision problems (MDPs) provide the foundations for a number of problems of interest to AI researchers studying automated planning and reinforcement learning. In this paper, we summarize results regarding the complexity of solving MDPs and the running time of MDP solution algorithms. We argue that, although MDPs can be solved efficiently in theory, more study is needed to reveal practical algorithms for solving large problems quickly. To encourage future research, we sketch some alternative methods of analysis that rely on the structure of MDPs.},\n urldate = {2019-01-21},\n date = {2013-02-20},\n keywords = {Computer Science - Artificial Intelligence},\n author = {Littman, Michael L. and Dean, Thomas L. and Kaelbling, Leslie Pack},\n file = {/home/dimitri/Nextcloud/Zotero/storage/R6IPHFQW/Littman et al. - 2013 - On the Complexity of Solving Markov Decision Probl.pdf;/home/dimitri/Nextcloud/Zotero/storage/7NDC6AA9/1302.html}\n}\n\n","author_short":["Littman, M. L.","Dean, T. L.","Kaelbling, L. P."],"key":"littmanComplexitySolvingMarkov2013","id":"littmanComplexitySolvingMarkov2013","bibbaseid":"littman-dean-kaelbling-onthecomplexityofsolvingmarkovdecisionproblems","role":"author","urls":{"Paper":"http://arxiv.org/abs/1302.4971"},"keyword":["Computer Science - Artificial Intelligence"],"downloads":0},"bibtype":"article","biburl":"https://raw.githubusercontent.com/dlozeve/newblog/master/bib/all.bib","creationDate":"2020-01-08T20:39:39.230Z","downloads":0,"keywords":["computer science - artificial intelligence"],"search_terms":["complexity","solving","markov","decision","problems","littman","dean","kaelbling"],"title":"On the Complexity of Solving Markov Decision Problems","year":null,"dataSources":["3XqdvqRE7zuX4cm8m"]}