On polynomial cases of the unichain classification problem for Markov decision processes

DOI10.1016/J.ORL.2008.06.002zbMath1210.90173OpenAlexW2089363577MaRDI QIDQ957336

Eugene A. Feinberg, Fenghsu Yang

Publication date: 27 November 2008

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

Full work available at URL: https://doi.org/10.1016/j.orl.2008.06.002

zbMATH Keywords

Markov decision processrecurrent stateunichain condition

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Markov and semi-Markov decision processes (90C40)

Related Items (1)

On the reduction of total‐cost and average‐cost MDPs to discounted MDPs

Cites Work

• Optimal control of diffusion processes with reflection
• NP-hardness of checking the unichain condition in average cost MDPs
• Finite state Markovian decision processes
• Optimal decision procedures for finite Markov chains. Part III: General convex systems
• Optimal Node Visitation in Stochastic Digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On polynomial cases of the unichain classification problem for Markov decision processes