1 / 17

Processing a Decision Tree

Processing a Decision Tree. Connecticut Electronics. The Original Decision Tree. Go as far to the right as possible, and pick a terminal node. Back up one step, landing on either a chance node or a choice node. At a chance node, put the following expectation.

thalia
Download Presentation

Processing a Decision Tree

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Processing a Decision Tree Connecticut Electronics

  2. The Original Decision Tree

  3. Go as far to the right as possible, and pick a terminal node

  4. Back up one step, landing on either a chance node or a choice node

  5. At a chance node, put thefollowing expectation

  6. Go as far to the right as possible, and pick a terminal node

  7. Back up one step, landing on either a chance node or a choice node

  8. At a chance node, put thefollowing expectation

  9. Go as far to the right as possible, and pick a terminal node

  10. Back up one step, landing on either a chance node or a choice node

  11. At a choice node, put the chosen following payoff and record the choice “sampled and good”: process

  12. Go as far to the right as possible, and pick a terminal node “sampled and good”: process

  13. Back up one step, landing on either a chance node or a choice node “sampled and good”: process

  14. At a choice node, put the chosen following payoff and record the choice “sampled and good”: process “sampled and bad”: replate

  15. Go as far to the right as possible, and pick a terminal node “sampled and good”: process “sampled and bad”: replate

  16. Back up one step, landing on either a chance node or a choice node “sampled and good”: process “sampled and bad”: replate

  17. At a chance node, put thefollowing expectation “sampled and good”: process “sampled and bad”: replate When finished, you’re left with the optimal “choice” strategy, and the expected payoff yielded by following that strategy.

More Related