An Efficient Sampling Algorithm for Influence Diagrams
Daniel Garcia-Sanchez, Marek J. Drużdżel · 2004
We describe an efficient sampling algorithm for solving influence diagrams that achieves its efficiency by reusing samples for each of the decision strategies. Our algorithm is exhaustive in the sense of computing the expected utility of each of the possible decision strategies. We show how by a parallel evaluation of all strategies we not only save a significant amount of computation but also produce better quality anytime behavior. 1