1
Slide 1Decision graphs I Decisions and utilities
Anders Ringgaard Kristensen
Slide 2Several names
Decision graphs
- Decision trees
- Influence diagrams
- A certain kind of strictly symmetric decision trees
- “No forgetting” assumption
- LIMIDs – Limited Memory Influence Diagrams
- Influence diagrams without the “no forgetting”
assumption
Very often the terms “Decision graphs” and “Influence diagrams” are used synonymously.
Slide 3Where are we?
First processing: Monitoring & filtering Second processing: Decision making Some methods integrate the whole setup
Bayesian Networks Decision Graphs
Slide 4Bayesian networks to Decision graphs
If we have a Bayesian network and add:
- Decision nodes
- Utility nodes
Then we have a decision graph (if we obey certain rules) Algorithms for optimization of decisions are available
Slide 5Notation, variables (= nodes)
C
Random variable, Chance node
D
Decision variable, Decision node D =
U
= U Utility variable, Utility node
Slide 6Numerical contents Edges into a chance node (yellow circle) correspond to a set of conditional probabilities. They express the influence of the values of the parents on the value of the child. Edges into a utility node correspond to a function depending on the values of the parents. Edges into a decision node just means that the values of the parents are known when the decision is made. They are called information edges. The decision may depend on the values of its parents.
Parent 1 Child Parent 2 Parent 1 Child Parent 2 Parent 1 Child Parent 2