A search tree represents a decision process as branching paths. The root describes the current state, action nodes show available choices, and later branches show possible scenarios with probabilities and utilities. section 12.1
The structure makes uncertainty visible. Begin at the leaf outcomes, multiply each utility by its branch probability, and add the weighted utilities leading to each action. Choose the action with the greatest expected utility. section 12.2
A search tree can represent:
- A single decision followed by uncertain outcomes. section 12.1
- Sequential decisions in which observed results influence whether another action is taken. section 12.7
- Continuous uncertainty, where one action may have infinitely many branches indexed by a variable such as a conversion rate. section 12.4
Choosing between policies
A government can implement policy A, implement riskier policy B, or do nothing. Policy A has expected utility 6.5, policy B has expected utility 1, and doing nothing has utility 0, so the tree favors policy A. With sequential choices, the government can observe the first policy's payoff before deciding whether to continue. section 12.7
Table 12.3 Utility of two available policies under possible scenarios and the corresponding probabilities
|
Option
|
Policy A
|
Policy B
|
Doing nothing
|
||
|
Cost
|
1
|
2
|
0
|
||
|
Utility
|
10
|
5
|
30
|
0
|
0
|
|
Probability
|
0.5
|
0.5
|
0.1
|
0.9
|
1
|
|
Option
|
Cost
|
Utility
|
Probability
|
|
Policy A
|
1
|
10
|
0.5
|
|
5
|
0.5
|
||
|
Policy B
|
2
|
30
|
0.1
|
|
0
|
0.9
|
||
|
Doing nothing
|
0
|
0
|
1
|
Use the utility table to inspect the costs, outcomes, and probabilities that become the branches and terminal values of a policy search tree. section 12.7

