NP-Hardness of checking the unichain condition in average cost MDPs
Author(s)Tsitsiklis, John N.
MetadataShow full item record
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 discussion of the merits of the more general weak accessibility condition.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Operations Research Letters
Tsitsiklis, John N. “NP-Hardness of Checking the Unichain Condition in Average Cost MDPs.” Operations Research Letters 35.3 (2007): 319–323. Web. 12 Apr. 2012. © 2006 Elsevier B.V.
Final published version