scientific article; zbMATH DE number 513084
From MaRDI portal
Publication:4281774
zbMath0792.93120MaRDI QIDQ4281774
Publication date: 7 April 1994
Full work available at URL: https://eudml.org/doc/27703
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
Value iteration in average cost Markov control processes on Borel spaces ⋮ On Linear Programming for Constrained and Unconstrained Average-Cost Markov Decision Processes with Countable Action Spaces and Strictly Unbounded Costs ⋮ Average control of Markov decision processes with Feller transition probabilities and general action spaces ⋮ On the Minimum Pair Approach for Average Cost Markov Decision Processes with Countable Discrete Action Spaces and Strictly Unbounded Costs ⋮ Convex analytic method revisited: further optimality results and performance of deterministic policies in average cost stochastic control
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Time-average control of martingale problems: A linear programming formulation
- Optimal controls for diffusion in \(R^ d\)- a min-max max-min formula for the minimal cost growth rate
- Stochastic optimal control. The discrete time case
- Average optimality in dynamic programming on Borel spaces -- unbounded costs and controls
- Measurable selection theorems for optimization problems
- Adaptive Markov control processes
- Average cost optimal policies for Markov control processes with Borel state space and unbounded costs
- Recurrence conditions for Markov decision processes with Borel state space: A survey
- Semi-Markov and Jump Markov Controlled Models: Average Cost Criterion
- Control of Markov Chains with Long-Run Average Cost Criterion: The Dynamic Programming Equations
- The Existence of a Minimum Pair of State and Policy for Markov Decision Processes under the Hypothesis of Doeblin
- Ergodic Theorems for Discrete Time Stochastic Systems Using a Stochastic Lyapunov Function
- Memoryless Strategies in Finite-Stage Dynamic Programming
- Discounted Dynamic Programming
This page was built for publication: