Operations Research
Dynamic Programming: Models and Applications
Dynamic Programming: Models and Applications
Decision Graph Search
A Computational Theory of Decision Networks
A Computational Theory of Decision Networks
A computational theory of decision networks
A computational theory of decision networks
Decision graphs: algorithms and applications to influence diagram evaluation and high-level path planning under uncertainty
Efficient non-myopic value-of-information computation for influence diagrams
International Journal of Approximate Reasoning
Determining the value of information for collaborative multi-agent planning
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
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.