Representing and solving decision problems with limited information

DOI10.1287/MNSC.47.9.1235.9779zbMATH Open1232.90343OpenAlexW2144349330WikidataQ57394034 ScholiaQ57394034MaRDI QIDQ3114726FDOQ3114726

Authors: Dennis Nilsson, Steffen Lauritzen 

Publication date: 19 February 2012

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.47.9.1235.9779

Recommendations

• Solving limited memory influence diagrams
• Fast local search methods for solving limited memory influence diagrams
• Speeding up \(k\)-neighborhood local search in limited memory influence diagrams
• Influence diagrams with memory states: representation and algorithms
• On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables

zbMATH Keywords

optimal strategieslocal computationmessage passingpartially observed Markov decision processsingle policy updating

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40)

Cited In (38)

• Influence diagrams with memory states: representation and algorithms
• A comparison of two approaches for solving unconstrained influence diagrams
• Title not available (Why is that?)
• Probabilistic decision graphs for optimization under uncertainty
• Computing probability intervals with simulated annealing and probability trees
• Probabilistic decision graphs for optimization under uncertainty
• A list-based compact representation for large decision tables management
• Solving limited memory influence diagrams
• Decision-network polynomials and the sensitivity of decision-support models
• An improved method for solving hybrid influence diagrams
• Solving linear-quadratic conditional Gaussian influence diagrams
• A forward-backward Monte Carlo method for solving influence diagrams
• Multi-agent influence diagrams for representing and solving games.
• Reward tampering problems and solutions in reinforcement learning: a causal influence diagram perspective
• Intermittent sampling for statistical process control with the number of defectives
• The value of (bounded) memory in a changing world
• A two-state partially observable Markov decision process with three actions
• Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams
• Fast local search methods for solving limited memory influence diagrams
• On Imperfect Recall in Multi-Agent Influence Diagrams
• Sequential decision making with partially ordered preferences
• Markov limid processes for representing and solving renewal problems
• Decision programming for mixed-integer multi-stage optimization under uncertainty
• Influence Diagrams for Causal Modelling and Inference
• A framework for solving hybrid influence diagrams containing deterministic conditional distributions
• On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables
• Object-oriented Bayesian networks for a decision support system for antitrust enforcement
• Learning a decision maker's utility function from (possibly) inconsistent behavior
• Influence diagrams for speed profile optimization
• Reasoning about causality in games
• Decision making with hybrid influence diagrams using mixtures of truncated exponentials
• Computer science and decision theory
• Decision analysis networks
• Basic research problems: The problem of choosing the representation, inference rule, and strategy
• Discrete Actions in Information-Constrained Decision Problems
• Speeding up \(k\)-neighborhood local search in limited memory influence diagrams
• An axiomatic framework for influence diagram computation with partially ordered preferences
• AN EXTENSION OF LAZY EVALUATION FOR INFLUENCE DIAGRAMS AVOIDING REDUNDANT VARIABLES IN THE POTENTIALS

This page was built for publication: Representing and solving decision problems with limited information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3114726)