On constrained Markov decision processes
From MaRDI portal
Publication:2564237
DOI10.1016/0167-6377(96)00003-XzbMath0865.90133OpenAlexW2027614944MaRDI QIDQ2564237
Publication date: 7 January 1997
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(96)00003-x
constrained optimizationBellman's principle of optimalitymultichain Markov decision processsample-path constraints
Related Items (5)
Risk-Averse Stochastic Programming: Time Consistency and Optimal Stopping ⋮ Optimal policies for constrained average-cost Markov decision processes ⋮ On Bellman's principle with inequality constraints ⋮ Constrained Markov decision processes in Borel spaces: from discounted to average optimality ⋮ Markov control processes with pathwise constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal policies for controlled Markov chains with a constraint
- Multichain Markov Decision Processes with a Sample Path Constraint: A Decomposition Approach
- Constrained Undiscounted Stochastic Dynamic Programming
- Markov Decision Processes with Sample Path Constraints: The Communicating Case
- Contraction Mappings in the Theory Underlying Dynamic Programming
- Constrained Markov Decision Chains
This page was built for publication: On constrained Markov decision processes