[edit]
Solving Influence Diagrams Using Gibbs Sampling
Pre-proceedings of the Fifth International Workshop on Artificial Intelligence and Statistics, PMLR R0:278-284, 1995.
Abstract
We describe a Monte Carlo method for solving influence diagrams. This method is a combination of stochastic dynamic programming and Gibbs sampling, an iterative Markov chain Monte Carlo algorithm. Our method is especially useful when exact methods for solving influence diagrams fail.