NP-Hardness of checking the unichain condition in average cost MDPs
Name
Tsitsiklis-2007-NP-Hardness of checking the unichain condition in average cost MDPs.pdf
Size
144.41 KB
Format
Adobe PDF
Checksum (MD5)
dd96532d810d0bd011143b44e716634e
Author(s)
Tsitsiklis, John N.
Date Issued
August 2006
Journal
Operations Research Letters
Publisher
Elsevier
Citation
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.
Version
Final published version
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/j.orl.2006.06.005
