Denumerable Constrained Markov Decision Processes and Finite Approximations
From MaRDI portal
Publication:4294737
DOI10.1287/moor.19.1.169zbMath0807.90122OpenAlexW2052851812MaRDI QIDQ4294737
Publication date: 18 May 1994
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a9575bc13b65a027034bd84aad92c5edee0e2c88
finite approximationdiscounted costconstrained Markov decision processescountable state spacestationary optimal policy
Related Items (17)
Constrained discounted stochastic games ⋮ Asymptotic properties of constrained Markov Decision Processes ⋮ Discounted Cost Markov Decision Processes with a Constraint ⋮ Circumventing the Slater conundrum in countably infinite linear programs ⋮ An optimal control approach to day-to-day congestion pricing for stochastic transportation networks ⋮ The Linear Program approach in multi-chain Markov Decision Processes revisited ⋮ Exact finite approximations of average-cost countable Markov decision processes ⋮ The LP approach in average reward MDPs with multiple cost constraints: The countable state case ⋮ Discounted Continuous-Time Controlled Markov Chains: Convergence of Control Models ⋮ Finite approximation of the first passage models for discrete-time Markov decision processes with varying discount factors ⋮ Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space ⋮ Convergence of Markov decision processes with constraints and state-action dependent discount factors ⋮ Strong Uniform Value in Gambling Houses and Partially Observable Markov Decision Processes ⋮ Average Reward Markov Decision Processes with Multiple Cost Constraints ⋮ Multiple objective nonatomic Markov decision processes with total reward criteria ⋮ Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces ⋮ First passage Markov decision processes with constraints and varying discount factors
This page was built for publication: Denumerable Constrained Markov Decision Processes and Finite Approximations