Using mathematical programming to solve factored Markov decision processes with imprecise probabilities
DOI10.1016/J.IJAR.2011.04.002zbMATH Open1229.90255DBLPjournals/ijar/DelgadoBCS11OpenAlexW2152240460WikidataQ62047364 ScholiaQ62047364MaRDI QIDQ648368FDOQ648368
Authors: Karina Valdivia Delgado, Leliane Nunes de Barros, Fabio Gagliardi Cozman, Scott Sanner 
Publication date: 22 November 2011
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2011.04.002
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Statistical decision theory and Bayesian analysis. 2nd ed
- Title not available (Why is that?)
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- The Complexity of Markov Decision Processes
- An inexact-restoration method for nonlinear bilevel programming problems
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Title not available (Why is that?)
- Robust Control of Markov Decision Processes with Uncertain Transition Matrices
- Title not available (Why is that?)
- Discrete time Markov chains with interval probabilities
- A tutorial on geometric programming
- An Analysis of Stochastic Shortest Path Problems
- Generalized polynomial approximations in Markovian decision processes
- Convex two-level optimization
- Title not available (Why is that?)
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- Optimal control of diffusion processes with reflection
- Credal networks
- Title not available (Why is that?)
- Graphical models for imprecise probabilities
- Bounded-parameter Markov decision processes
- Linear programming and sequential decisions
- The steepest descent direction for the nonlinear bilevel programming problem
- Markov Decision Processes with Imprecise Transition Probabilities
- Markovian Decision Processes with Uncertain Transition Probabilities
- Problems in multilinear programming.
- Symmetric approximate linear programming for factored MDPs with application to constrained problems
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
- Title not available (Why is that?)
- 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
Uses Software
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)
