The Complexity of Approximately Solving Influence Diagrams

10/16/2012
by   Denis D. Mauá, et al.
0

Influence diagrams allow for intuitive and yet precise description of complex situations involving decision making under uncertainty. Unfortunately, most of the problems described by influence diagrams are hard to solve. In this paper we discuss the complexity of approximately solving influence diagrams. We do not assume no-forgetting or regularity, which makes the class of problems we address very broad. Remarkably, we show that when both the tree-width and the cardinality of the variables are bounded the problem admits a fully polynomial-time approximation scheme.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/08/2011

Solving Limited Memory Influence Diagrams

We present a new algorithm for exactly solving decision making problems ...
research
09/26/2013

Solving Limited-Memory Influence Diagrams Using Branch-and-Bound Search

A limited-memory influence diagram (LIMID) generalizes a traditional inf...
research
03/15/2012

Solving Hybrid Influence Diagrams with Deterministic Variables

We describe a framework and an algorithm for solving hybrid influence di...
research
02/14/2012

Order-of-Magnitude Influence Diagrams

In this paper, we develop a qualitative theory of influence diagrams tha...
research
03/06/2013

Tradeoffs in Constructing and Evaluating Temporal Influence Diagrams

This paper addresses the tradeoffs which need to be considered in reason...
research
07/01/2020

Reasoning with Contextual Knowledge and Influence Diagrams

Influence diagrams (IDs) are well-known formalisms extending Bayesian ne...
research
03/27/2013

Stochastic Sensitivity Analysis Using Fuzzy Influence Diagrams

The practice of stochastic sensitivity analysis described in the decisio...

Please sign up or login with your details

Forgot password? Click here to reset