Course Hive
Search

Welcome

Sign in or create your account

Continue with Google
or
Game Theory 101 (#70): The Purification Theorem
Play lesson

Game Theory 101 Full Course - Game Theory 101 (#70): The Purification Theorem

4.0 (1)
18 learners

What you'll learn

This course includes

  • 13.5 hours of video
  • Certificate of completion
  • Access on mobile and TV

Summary

Keywords

Full Transcript

The purification theorem says that almost all mixed strategy Nash equilibria can be reconceptualized as close approximations of pure strategy Bayesian Nash equilibria, in which the relative probabilities of taking each action are nearly identical. Thus, if you don't believe that players don't mix in real life, this isn't a problem: mixed strategy Nash equilibria are essentially pure strategy equilibria in disguise. Bonus note: John Harsanyi came up with the purification theorem. This was a major reason why he won a Nobel Prize in the same year of John Nash's victory.

Course Hive

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

FAQs

Course Hive
Download CourseHive
Keep learning anywhere