Markov Decision Processes with Sample Path Constraints: The Communicating Case
From MaRDI portal
Publication:4733697
Recommendations
- Multichain Markov Decision Processes with a Sample Path Constraint: A Decomposition Approach
- Markov control processes with pathwise constraints
- Average Reward Markov Decision Processes with Multiple Cost Constraints
- On constrained Markov decision processes
- scientific article; zbMATH DE number 3891132
Cited in
(24)- Markov control processes with pathwise constraints
- Comments on: ``A policy improvement method for constrained average Markov decision processes [Oper. Res. Lett. 35 (2007) 434-438]
- Average Reward Markov Decision Processes with Multiple Cost Constraints
- Resource-constrained management of heterogeneous assets with stochastic deterioration
- Sample path optimality for a Markov optimization problem
- Variance-minimization of Markov control processes with pathwise constraints
- On Bellman's principle with inequality constraints
- Path-constrained Markov decision processes: bridging the gap between probabilistic model-checking and decision-theoretic planning
- Partitioning multi-edge graphs
- STRONG AVERAGE OPTIMALITY FOR CONTROLLED NONHOMOGENEOUS MARKOV CHAINS*
- On constrained Markov decision processes
- Constrained Markov decision processes in Borel spaces: from discounted to average optimality
- A note on two-person zero-sum communicating stochastic games
- Rational Processes Related to Communicating Markov Processes
- Markov decision processes with burstiness constraints
- Another set of conditions for Markov decision processes with average sample-path costs
- Semi-infinite Markov decision processes
- The LP approach in average reward MDPs with multiple cost constraints: The countable state case
- Average sample-path optimality for continuous-time Markov decision processes in Polish spaces
- Constrained Semi-Markov decision processes with average rewards
- Constrained multiagent Markov decision processes: a taxonomy of problems and algorithms
- Multichain Markov Decision Processes with a Sample Path Constraint: A Decomposition Approach
- Sample-path optimality and variance-maximization for Markov decision processes
- An improved algorithm for solving communicating average reward Markov decision processes
This page was built for publication: Markov Decision Processes with Sample Path Constraints: The Communicating Case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733697)
