Controlled Markov chains with constraints.
From MaRDI portal
Publication:5955748
DOI10.1007/BF02811335zbMath1075.93546OpenAlexW2170708844MaRDI QIDQ5955748
Publication date: 18 February 2002
Published in: Sādhanā (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02811335
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Optimal stochastic control (93E20) Markov and semi-Markov decision processes (90C40)
Related Items
On Bellman's principle with inequality constraints ⋮ Maximizing the set of recurrent states of an MDP subject to convex constraints ⋮ Controlled diffusions with constraints ⋮ The average cost of Markov chains subject to total variation distance uncertainty ⋮ Sensitivity of constrained Markov decision processes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal policies for controlled Markov chains with a constraint
- On extreme points of convex sets
- Constrained Undiscounted Stochastic Dynamic Programming
- Control of Markov Chains with Long-Run Average Cost Criterion: The Dynamic Programming Equations
- Randomized and Past-Dependent Policies for Markov Decision Processes with Multiple Constraints
- Some aspects of convexity useful in information theory