Two Procedures for Compiling Influence Diagrams
arXiv:1303.1494
Abstract
Two algorithms are presented for "compiling" influence diagrams into a set of simple decision rules. These decision rules define simple-to-execute, complete, consistent, and near-optimal decision procedures. These compilation algorithms can be used to derive decision procedures for human teams solving time constrained decision problems.
Appears in Proceedings of the Ninth Conference on Uncertainty in Artificial Intelligence (UAI1993)