Pages that link to "Item:Q663675"
From MaRDI portal
The following pages link to Approximation of Markov decision processes with general state space (Q663675):
Displaying 26 items.
- A limit theorem for Markov decision processes (Q258747) (← links)
- Conditions for the solvability of the linear programming formulation for constrained discounted Markov decision processes (Q315764) (← links)
- Quantitative model-checking of controlled discrete-time Markov processes (Q515573) (← links)
- Semiparametric estimation of Markov decision processes with continuous state space (Q738126) (← links)
- A convex optimization approach to dynamic programming in continuous state and action spaces (Q831365) (← links)
- Near optimality of quantized policies in stochastic control under weak continuity conditions (Q892326) (← links)
- Approximating Markov decision processes using expected state transitions (Q1075954) (← links)
- Finite-state approximations for denumerable multidimensional state discounted Markov decision processes (Q1079512) (← links)
- Generalizing Markov decision processes to imprecise probabilities (Q1611811) (← links)
- Approximation of discounted minimax Markov control problems and zero-sum Markov games using Hausdorff and Wasserstein distances (Q1741211) (← links)
- Finite approximations in discrete-time stochastic control. Quantized models and asymptotic optimality (Q1746073) (← links)
- Relevant states and memory in Markov chain bootstrapping and simulation (Q1752182) (← links)
- Approximate policy iteration for Markov decision processes via quantitative adaptive aggregations (Q1990495) (← links)
- A stability result for linear Markovian stochastic optimization problems (Q2118100) (← links)
- Stochastic approximations of constrained discounted Markov decision processes (Q2338706) (← links)
- Clustering Based Approximation Procedure for Semi-Markov Decision Processes with Incomplete State Information (Q3155291) (← links)
- Policy Bounds for Markov Decision Processes (Q3770309) (← links)
- From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming (Q4571046) (← links)
- Computable approximations for average Markov decision processes in continuous time (Q4684960) (← links)
- (Q5054596) (← links)
- Nonasymptotic Analysis of Monte Carlo Tree Search (Q5060499) (← links)
- On Finite Approximations to Markov Decision Processes with Recursive and Nonlinear Discounting (Q5153610) (← links)
- A perturbation approach to approximate value iteration for average cost Markov decision processes with Borel spaces and bounded costs (Q5227201) (← links)
- Approximation of average cost Markov decision processes using empirical distributions and concentration inequalities (Q5265786) (← links)
- On State Aggregation to Approximate Complex Value Functions in Large-Scale Markov Decision Processes (Q5347606) (← links)
- Certified reinforcement learning with logic guidance (Q6136089) (← links)
