Incremental computation of the value of perfect information in stepwise-decomposable influence diagrams

by   Nevin Lianwen Zhang, et al.

To determine the value of perfect information in an influence diagram, one needs first to modify the diagram to reflect the change in information availability, and then to compute the optimal expected values of both the original diagram and the modified diagram. The value of perfect information is the difference between the two optimal expected values. This paper is about how to speed up the computation of the optimal expected value of the modified diagram by making use of the intermediate computation results obtained when computing the optimal expected value of the original diagram.


page 1

page 2


Value of Evidence on Influence Diagrams

In this paper, we introduce evidence propagation operations on influence...

Solving Influence Diagrams using HUGIN, Shafer-Shenoy and Lazy Propagation

In this paper we compare three different architectures for the evaluatio...

The DIDI dataset: Digital Ink Diagram data

We are releasing a dataset of diagram drawings with dynamic drawing info...

Deletion in abstract Voronoi diagrams in expected linear time

Updating an abstract Voronoi diagram in linear time, after deletion of o...

Towards improving architectural diagram consistency using system descriptors

Communication between practitioners is essential for the system's qualit...

Estimating the Value of Computation in Flexible Information Refinement

We outline a method to estimate the value of computation for a flexible ...

Constraining Influence Diagram Structure by Generative Planning: An Application to the Optimization of Oil Spill Response

This paper works through the optimization of a real world planning probl...