We apply the main idea from last time, iterative deletion of dominated strategies, to analyze an election where candidates can choose their policy positions. We then consider how good is this classic model as a description of the real political process, and how we might build on it to improve it. Toward the end of the class, we introduce a new idea to get us beyond iterative deletion. We think about our beliefs about what the other player is going to do, and then ask what is the best strategy for us to choose given those beliefs?

📑 Lecture Chapters:

Iterative Deletion of Dominated Strategies: The Median Voter Theorem [00:00:00]
Iterative Deletion of Dominated Strategies: Problems with The Median Voter Theorem [00:27:25]
Iterative Deletion of Dominated Strategies: Robustness of The Median Voter Theorem [00:35:07]
Best Response [00:39:11]

Source: Ben Polak, Game Theory (Yale University: Open Yale Courses). Licensed under CC BY-NC-SA 3.0.