Two Procedures for Compiling Influence Diagrams
Artificial Intelligence
2013-03-08 v1
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.
Cite
@article{arxiv.1303.1494,
title = {Two Procedures for Compiling Influence Diagrams},
author = {Paul E. Lehner and Azar Sadigh},
journal= {arXiv preprint arXiv:1303.1494},
year = {2013}
}
Comments
Appears in Proceedings of the Ninth Conference on Uncertainty in Artificial Intelligence (UAI1993)