NP-hardness of checking the unichain condition in average cost MDPs

DOI10.1016/j.orl.2006.06.005zbMath1169.90478OpenAlexW2022585556MaRDI QIDQ2467470

John N. Tsitsiklis

Publication date: 21 January 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/69999

zbMATH Keywords

Markov decision processesaverage costunichain condition

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40)

Related Items (4)

Markov Reward Models and Markov Decision Processes in Discrete and Continuous Time: Performance Evaluation and Optimization ⋮ Derman's book as inspiration: some results on LP for MDPs ⋮ On polynomial cases of the unichain classification problem for Markov decision processes ⋮ On the reduction of total‐cost and average‐cost MDPs to discounted MDPs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Empirical State-Action Frequencies in Markov Decision Processes Under General Policies

This page was built for publication: NP-hardness of checking the unichain condition in average cost MDPs