3. Iterative deletion and the median-voter theorem episode artwork

EPISODE · Sep 5, 2026 · 1H 8M

3. Iterative deletion and the median-voter theorem

from YaleCourses · host YaleCourses

Game Theory (ECON 159)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?00:00 - Chapter 1. Iterative Deletion of Dominated Strategies: The Median Voter Theorem27:25 - Chapter 2. Iterative Deletion of Dominated Strategies: Problems with The Median Voter Theorem35:07 - Chapter 3. Iterative Deletion of Dominated Strategies: Robustness of The Median Voter Theorem39:11 - Chapter 4. Best ResponseComplete course materials are available at the Yale Online website: online.yale.eduThis course was recorded in Fall 2007. Learn more about your ad choices. Visit megaphone.fm/adchoices

Episode metadata supplied by the publisher feed · Published Sep 5, 2026

Embed this episode

Ready to play

3. Iterative deletion and the median-voter theorem

0:00 1:08:04

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

No similar podcasts found.

Frequently Asked Questions

How long is this episode of YaleCourses?

This episode is 1 hour and 8 minutes long.

When was this YaleCourses episode published?

This episode was published on September 5, 2026.

Can I download this YaleCourses episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!