Algorithms for Influence Diagrams

  • Finn V. Jensen
Part of the Statistics for Engineering and Information Science book series (ISS)

Abstract

An influence diagram has three types of nodes, chance nodes, decision nodes, and utility nodes. The set of chance nodes is denoted U C , the set of decision nodes is denoted U D , and the set of utility nodes is denoted U V . The universe is U = U C U D . We also refer to the members of U as the variables of the influence diagram.

Keywords

Decision Variable Bayesian Network Optimal Policy Temporal Order Expected Utility 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  • Finn V. Jensen
    • 1
  1. 1.Department of Computer SciencesAalborg UniversityAalborg ØDenmark

Personalised recommendations