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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Jensen, F.V. (2001). Algorithms for Influence Diagrams. In: Bayesian Networks and Decision Graphs. Statistics for Engineering and Information Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3502-4_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3502-4_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-3504-8
Online ISBN: 978-1-4757-3502-4
eBook Packages: Springer Book Archive