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

DOI10.1016/J.ORL.2008.06.002MaRDI QIDQ957336zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Generalized polynomial approximations in Markovian decision processes
• On the Convergence of Policy Iteration in Finite State Undiscounted Markov Decision Processes: The Unichain Case
• Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
• Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
• scientific article; zbMATH DE number 2189770
• Polynomial approximation on unbounded subsets and the Markov moment problem
• Uniformization for semi-Markov decision processes under stationary policies
• scientific article; zbMATH DE number 3900544

Cites work

• Finite state Markovian decision processes
• scientific article; zbMATH DE number 3122709 (Why is no real title available?)
• scientific article; zbMATH DE number 3148886 (Why is no real title available?)
• scientific article; zbMATH DE number 475591 (Why is no real title available?)
• scientific article; zbMATH DE number 1786114 (Why is no real title available?)
• scientific article; zbMATH DE number 2189770 (Why is no real title available?)
• Network flows. Theory, algorithms, and applications.
• NP-hardness of checking the unichain condition in average cost MDPs
• Optimal control of diffusion processes with reflection
• Optimal decision procedures for finite Markov chains. Part III: General convex systems
• Optimal Node Visitation in Stochastic Digraphs

Cited in

(3)

• NP-hardness of checking the unichain condition in average cost MDPs
• On the reduction of total-cost and average-cost MDPs to discounted mdps
• scientific article; zbMATH DE number 2189770 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q957336)