Representing and Solving Decision Problems with Limited Information
From MaRDI portal
Publication:3114726
DOI10.1287/mnsc.47.9.1235.9779zbMath1232.90343OpenAlexW2144349330WikidataQ57394034 ScholiaQ57394034MaRDI QIDQ3114726
Dennis Nilsson, Steffen L. 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
optimal strategiesmessage passinglocal computationpartially observed Markov decision processsingle policy updating
Related Items (32)
A list-based compact representation for large decision tables management ⋮ Decision-network polynomials and the sensitivity of decision-support models ⋮ An improved method for solving hybrid influence diagrams ⋮ A two-state partially observable Markov decision process with three actions ⋮ Decision analysis networks ⋮ Influence Diagrams for Causal Modelling and Inference ⋮ Influence diagrams for speed profile optimization ⋮ Intermittent sampling for statistical process control with the number of defectives ⋮ 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 ⋮ Reasoning about causality in games ⋮ Unnamed Item ⋮ Reward tampering problems and solutions in reinforcement learning: a causal influence diagram perspective ⋮ On Imperfect Recall in Multi-Agent Influence Diagrams ⋮ Multi-agent influence diagrams for representing and solving games. ⋮ An axiomatic framework for influence diagram computation with partially ordered preferences ⋮ Sequential decision making with partially ordered preferences ⋮ Object-oriented Bayesian networks for a decision support system for antitrust enforcement ⋮ Probabilistic decision graphs for optimization under uncertainty ⋮ Markov limid processes for representing and solving renewal problems ⋮ AN EXTENSION OF LAZY EVALUATION FOR INFLUENCE DIAGRAMS AVOIDING REDUNDANT VARIABLES IN THE POTENTIALS ⋮ On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables ⋮ Decision making with hybrid influence diagrams using mixtures of truncated exponentials ⋮ Probabilistic decision graphs for optimization under uncertainty ⋮ A comparison of two approaches for solving unconstrained influence diagrams ⋮ Solving linear-quadratic conditional Gaussian influence diagrams ⋮ Computer science and decision theory ⋮ A forward-backward Monte Carlo method for solving influence diagrams ⋮ A Framework for Solving Hybrid Influence Diagrams Containing Deterministic Conditional Distributions ⋮ Computing probability intervals with simulated annealing and probability trees ⋮ Decision programming for mixed-integer multi-stage optimization under uncertainty ⋮ Learning a decision maker's utility function from (possibly) inconsistent behavior
This page was built for publication: Representing and Solving Decision Problems with Limited Information
