Describe the variable elimination steps for finding an optimal policy for a single-stage decision network.
  • Prune all the nodes that are not ancestors of the utility node. Sum out all the chance nodes. There will be a single factor F remaining that represents the expected utility for each combination of decision variables. If v is the maximum value in F, return the assignment d that gives that maximum value v.

Valid HTML 4.0 Transitional