DocumentCode
2149501
Title
Complexity issues in Markov decision processes
Author
Goldsmith, Judy ; Mundhenk, Martin
Author_Institution
Dept. of Comput. Sci., Kentucky Univ., Lexington, KY, USA
fYear
1998
fDate
15-18 Jun 1998
Firstpage
272
Lastpage
280
Abstract
We survey the complexity of computational problems about Markov decision processes: evaluating policies, finding good and best policies, approximating best policies, and related decision problems
Keywords
Markov processes; computational complexity; decision theory; Markov decision processes; approximating best policies; complexity; decision problems; evaluating policies; Artificial intelligence; Computer science; Control theory; Cost function; Decision making; Mathematics; Polynomials; Signal generators; Signal processing; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Complexity, 1998. Proceedings. Thirteenth Annual IEEE Conference on
Conference_Location
Buffalo, NY
ISSN
1093-0159
Print_ISBN
0-8186-8395-3
Type
conf
DOI
10.1109/CCC.1998.694621
Filename
694621
Link To Document