ML Anthology

Two Procedures for Compiling Influence Diagrams

Paul E. Lehner, Azar Sadigh
UAI 1993 pp. 335-341
doi:10.1016/B978-1-4832-1451-1.50045-7 /uai/1993/lehner1993uai-two/

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.

PDF UAI Semantic Scholar

Cite

Text

Lehner and Sadigh. "Two Procedures for Compiling Influence Diagrams." Conference on Uncertainty in Artificial Intelligence, 1993. doi:10.1016/B978-1-4832-1451-1.50045-7

Markdown

[Lehner and Sadigh. "Two Procedures for Compiling Influence Diagrams." Conference on Uncertainty in Artificial Intelligence, 1993.](https://mlanthology.org/uai/1993/lehner1993uai-two/) doi:10.1016/B978-1-4832-1451-1.50045-7

BibTeX

@inproceedings{lehner1993uai-two,
  title     = {{Two Procedures for Compiling Influence Diagrams}},
  author    = {Lehner, Paul E. and Sadigh, Azar},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {1993},
  pages     = {335-341},
  doi       = {10.1016/B978-1-4832-1451-1.50045-7},
  url       = {https://mlanthology.org/uai/1993/lehner1993uai-two/}
}