Using mathematical programming to solve factored Markov decision processes with imprecise probabilities
From MaRDI portal
(Redirected from Publication:648368)
Recommendations
- Efficient solutions to factored MDPs with imprecise transition probabilities
- A mathematical programming approach to a problem in variance penalised Markov decision processes
- Generalizing Markov decision processes to imprecise probabilities
- Markov Decision Processes with Imprecise Transition Probabilities
- Real-time dynamic programming for Markov decision processes with imprecise probabilities
- scientific article; zbMATH DE number 4039674
- scientific article; zbMATH DE number 4092676
- Solution Procedures for Partially Observed Markov Decision Processes
- Partially observable Markov decision processes with imprecise parameters
- Markov decision programming with constraints
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 48344 (Why is no real title available?)
- scientific article; zbMATH DE number 1315585 (Why is no real title available?)
- scientific article; zbMATH DE number 2000828 (Why is no real title available?)
- scientific article; zbMATH DE number 2238781 (Why is no real title available?)
- scientific article; zbMATH DE number 3061365 (Why is no real title available?)
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- A tutorial on geometric programming
- An Analysis of Stochastic Shortest Path Problems
- An inexact-restoration method for nonlinear bilevel programming problems
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Bounded-parameter Markov decision processes
- Convex two-level optimization
- Credal networks
- Discrete time Markov chains with interval probabilities
- Generalized polynomial approximations in Markovian decision processes
- Graphical models for imprecise probabilities
- Linear programming and sequential decisions
- Markov Decision Processes with Imprecise Transition Probabilities
- Markovian Decision Processes with Uncertain Transition Probabilities
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- Optimal control of diffusion processes with reflection
- Problems in multilinear programming.
- Robust Control of Markov Decision Processes with Uncertain Transition Matrices
- Statistical decision theory and Bayesian analysis. 2nd ed
- Symmetric approximate linear programming for factored MDPs with application to constrained problems
- The Complexity of Markov Decision Processes
- The steepest descent direction for the nonlinear bilevel programming problem
Cited in
(7)- Robust topological policy iteration for infinite horizon bounded Markov decision processes
- A survey of decision making and optimization under uncertainty
- A sufficient statistic for influence in structured multiagent environments
- scientific article; zbMATH DE number 4092676 (Why is no real title available?)
- Generalizing Markov decision processes to imprecise probabilities
- Real-time dynamic programming for Markov decision processes with imprecise probabilities
- Efficient solutions to factored MDPs with imprecise transition probabilities
This page was built for publication: Using mathematical programming to solve factored Markov decision processes with imprecise probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648368)
