逐步可分解影响图中完全信息值的增量计算
Incremental computation of the value of perfect information in stepwise-decomposable influence diagrams
摘要：
为了确定影响图中完美信息的价值，首先需要修改图以反映信息可用性的变化，然后计算原始图和修改后的图的最佳期望值。完全信息的价值是两个最优期望值之差。本文讨论了如何利用原图最优期望值计算时得到的中间计算结果，加快修正图最优期望值的计算速度。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
