From Influence Diagrams to Junction Trees

2013/02/27 by Jensen, Frank, Jensen, Finn Verner, Dittmer, Soren L.
#Artificial Intelligence (cs.AI) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1302.6824

Abstract

We present an approach to the solution of decision problems formulated as influence diagrams. This approach involves a special triangulation of the underlying graph, the construction of a junction tree with special properties, and a message passing algorithm operating on the junction tree for computation of expected utilities and optimal decision policies.

Related

• Risk-averse decision strategies for influence diagrams using rooted junction trees
• Integer programming on the junction tree polytope for influence diagrams
• Myopic Value of Information in Influence Diagrams
• Flexible Policy Construction by Information Refinement
• Solving influence diagrams via efficient mixed-integer programming formulations and heuristics