NP-Hardness of checking the unichain condition in average cost MDPs
The unichain condition requires that every policy in an MDP result in a single ergodic class, and guarantees that the optimal average cost is independent of the initial state. We show that checking whether the unichain condition fails to hold is an NP-complete problem. We conclude with a brief discu...
Main Author: | Tsitsiklis, John N. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Elsevier
2012
|
Online Access: | http://hdl.handle.net/1721.1/69999 https://orcid.org/0000-0003-2658-8239 |
Similar Items
-
Probabilistic Bisimulations for PCTL Model Checking of Interval MDPs
by: Vahid Hashemi, et al.
Published: (2014-03-01) -
NP-hardness of deciding convexity of quartic polynomials and related problems
by: Ahmadi, Amir Ali, et al.
Published: (2012) -
Markov decision processes in artificial intelligence : MDPs, beyond MDPs and applications /
by: Sigaud, Olivier, et al.
Published: (2010) -
On the NP-hardness of checking matrix polytope stability and continuous-time switching stability
by: Gurvits, Leonid, et al.
Published: (2010) -
Transience in countable MDPs
by: Kiefer, SM, et al.
Published: (2021)