Complexity issues in Markov decision processes

J. Goldsmith, M. Mundhenk

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

19 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings - 13th Annual IEEE Conference on Computational Complexity, CCC 1998
Pages272-280
Number of pages9
DOIs
StatePublished - 1998
Event13th Annual IEEE Conference on Computational Complexity, CCC 1998 - Buffalo, United States
Duration: Jun 15 1998Jun 18 1998

Publication series

NameProceedings of the Annual IEEE Conference on Computational Complexity
ISSN (Print)1093-0159

Conference

Conference13th Annual IEEE Conference on Computational Complexity, CCC 1998
Country/TerritoryUnited States
CityBuffalo
Period6/15/986/18/98

Bibliographical note

Publisher Copyright:
© 1998 IEEE.

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'Complexity issues in Markov decision processes'. Together they form a unique fingerprint.

Cite this