Complexity issues in Markov decision processes

J. Goldsmith; M. Mundhenk

doi:10.1109/CCC.1998.694621

Complexity issues in Markov decision processes

J. Goldsmith, M. Mundhenk

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

18 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 language	English
Title of host publication	Proceedings - 13th Annual IEEE Conference on Computational Complexity, CCC 1998
Pages	272-280
Number of pages	9
DOIs	https://doi.org/10.1109/CCC.1998.694621
State	Published - 1998
Event	13th Annual IEEE Conference on Computational Complexity, CCC 1998 - Buffalo, United States Duration: Jun 15 1998 → Jun 18 1998

Publication series

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

Conference

Conference	13th Annual IEEE Conference on Computational Complexity, CCC 1998
Country/Territory	United States
City	Buffalo
Period	6/15/98 → 6/18/98

ASJC Scopus subject areas

Software
Theoretical Computer Science
Computational Mathematics

Access to Document

10.1109/CCC.1998.694621

Cite this

@inproceedings{8b32e62612254c43ba951229618252ce,

title = "Complexity issues in Markov decision processes",

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.",

author = "J. Goldsmith and M. Mundhenk",

year = "1998",

doi = "10.1109/CCC.1998.694621",

language = "English",

isbn = "0818683953",

series = "Proceedings of the Annual IEEE Conference on Computational Complexity",

pages = "272--280",

booktitle = "Proceedings - 13th Annual IEEE Conference on Computational Complexity, CCC 1998",

note = "13th Annual IEEE Conference on Computational Complexity, CCC 1998 ; Conference date: 15-06-1998 Through 18-06-1998",

}

Goldsmith, J & Mundhenk, M 1998, Complexity issues in Markov decision processes. in Proceedings - 13th Annual IEEE Conference on Computational Complexity, CCC 1998., 694621, Proceedings of the Annual IEEE Conference on Computational Complexity, pp. 272-280, 13th Annual IEEE Conference on Computational Complexity, CCC 1998, Buffalo, United States, 6/15/98. https://doi.org/10.1109/CCC.1998.694621

TY - GEN

T1 - Complexity issues in Markov decision processes

AU - Goldsmith, J.

AU - Mundhenk, M.

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84989923067&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84989923067&partnerID=8YFLogxK

U2 - 10.1109/CCC.1998.694621

DO - 10.1109/CCC.1998.694621

M3 - Conference contribution

AN - SCOPUS:84989923067

SN - 0818683953

T3 - Proceedings of the Annual IEEE Conference on Computational Complexity

SP - 272

EP - 280

BT - Proceedings - 13th Annual IEEE Conference on Computational Complexity, CCC 1998

T2 - 13th Annual IEEE Conference on Computational Complexity, CCC 1998

Y2 - 15 June 1998 through 18 June 1998

ER -

Complexity issues in Markov decision processes

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this