Incremental computation of the value of perfect information in stepwise-decomposable influence diagrams
Nevin Zhang, Runping Qi, David Poole
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.
PDF Link: /papers/93/p400-zhang.pdf
AUTHOR = "Nevin Zhang
and Runping Qi and David Poole",
TITLE = "Incremental computation of the value of perfect information in stepwise-decomposable influence diagrams",
BOOKTITLE = "Proceedings of the Ninth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-93)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Francisco, CA",
YEAR = "1993",
PAGES = "400--407"