Denumerable Constrained Markov Decision Processes and Finite Approximations
From MaRDI portal
Publication:4294737
DOI10.1287/moor.19.1.169zbMath0807.90122MaRDI 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 approximation; discounted cost; constrained Markov decision processes; countable state space; stationary optimal policy
Related Items
Discounted Cost Markov Decision Processes with a Constraint, The LP approach in average reward MDPs with multiple cost constraints: The countable state case, Average Reward Markov Decision Processes with Multiple Cost Constraints, The Linear Program approach in multi-chain Markov Decision Processes revisited, Discounted Continuous-Time Controlled Markov Chains: Convergence of Control Models, Asymptotic properties of constrained Markov Decision Processes, Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces, Circumventing the Slater conundrum in countably infinite linear programs, Finite approximation of the first passage models for discrete-time Markov decision processes with varying discount factors, Multiple objective nonatomic Markov decision processes with total reward criteria, Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space, Constrained discounted stochastic games, An optimal control approach to day-to-day congestion pricing for stochastic transportation networks, Convergence of Markov decision processes with constraints and state-action dependent discount factors, First passage Markov decision processes with constraints and varying discount factors, Exact finite approximations of average-cost countable Markov decision processes, Strong Uniform Value in Gambling Houses and Partially Observable Markov Decision Processes
