Extreme Occupation Measures in Markov Decision Processes with an Absorbing State
From MaRDI portal
Publication:6180250
DOI10.1137/23m1572398arXiv2307.03158WikidataQ130128219 ScholiaQ130128219MaRDI QIDQ6180250
Yi Zhang, Aleksey B. Piunovskiy
Publication date: 19 January 2024
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2307.03158
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditions for the solvability of the linear programming formulation for constrained discounted Markov decision processes
- Convex analytic approach to constrained discounted Markov decision processes with non-constant discount factors
- Constrained total undiscounted continuous-time Markov decision processes
- Optimal policies for constrained average-cost Markov decision processes
- A convex analytic approach to Markov decision processes
- Stochastic optimal control. The discrete time case
- On dynamic programming: Compactness of the space of policies
- Constrained Markov control processes in Borel spaces: the discounted case
- Constrained discounted Markov decision processes with Borel state spaces
- Constrained continuous-time Markov decision processes on the finite horizon
- Optimality of Mixed Policies for Average Continuous-Time Markov Decision Processes with Constraints
- The Expected Total Cost Criterion for Markov Decision Processes under Constraints
- Splitting Randomized Stationary Policies in Total-Reward Markov Decision Processes
- Multiobjective Stopping Problem for Discrete-Time Markov Processes: Convex Analytic Approach
- Discounted Continuous-Time Markov Decision Processes with Unbounded Rates: The Convex Analytic Approach
- The Expected Total Cost Criterion for Markov Decision Processes under Constraints: A Convex Analytic Approach
- Controlled Markov Processes with Arbitrary Numerical Criteria
- Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal
- Controlled random sequences: methods of convex analysis and problems with functional constraints
- Constrained Discounted Dynamic Programming
- Proper Policies in Infinite-State Stochastic Shortest Path Problems
- Sufficiency of Deterministic Policies for Atomless Discounted and Uniformly Absorbing MDPs with Multiple Criteria
- Average Optimality in Markov Control Processes via Discounted-Cost Problems and Linear Programming
- Gradual-Impulsive Control for Continuous-Time Markov Decision Processes with Total Undiscounted Costs and Constraints: Linear Programming Approach via a Reduction Method
- Continuous-Time Markov Decision Processes
- A Convex Programming Approach for Discrete-Time Markov Decision Processes under the Expected Total Reward Criterion
- On Reducing a Constrained Gradual-Impulsive Control Problem for a Jump Markov Model to a Model with Gradual Control Only
- Extreme Points of Sets of Randomized Strategies in Constrained Optimization and Control Problems
This page was built for publication: Extreme Occupation Measures in Markov Decision Processes with an Absorbing State
