Open Yale Courses

ECON 159: Game Theory

Lecture 3 - Iterative deletion and the median-voter theorem << previous session | next session >>

Overview:

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?

Reading assignment:

Strategies and Games: Theory And Practice. (Dutta): Chapter 2, Section 3; Chapters 3-4

Strategy: An Introduction to Game Theory. (Watson): Chapters 6-8

Thinking Strategically. (Dixit and Nalebuff): Chapter 3, Sections 1-3

Class lecture:

Transcript
html
Audio
mp3
Video
medium bandwidth
low bandwidth
high bandwidth

Resources:

Problem Set 1 [PDF]

Blackboard Notes Lecture 3 [PDF]

Yale University 2008.  Some rights reserved. Unless otherwise indicated on this page or on the Open Yale Courses website, all content on this page is licensed under a Creative Commons License (Attribution-NonCommercial-ShareAlike 3.0)