Problem Set 2
Problem Set 2
Player 2
Player 1 x y z
a 1, 2 1, 2 0, 3
b 4, 0 1, 3 0, 2
c 3, 1 2, 1 1, 2
d 0, 2 0, 1 2, 4
Find which strategies survive the iterative deletion of strictly dominated strategies.
1
Exercise 4 — Political Competition (Median Voter)
Consider two candidates competing for office: Democrat (D) and Republican (R). While they
can compete along several dimensions (such as their past policies, their endorsements from labor unions,
their advertising, and even their looks!), we assume for simplicity that voters compare the two candidates
according to only one dimension (e.g., the budget share that each candidate promises to spend on education).
Voters’ ideal policies are uniformly distributed along the interval [0, 1], and each votes for the candidate with
a policy promise closest to the voter’s ideal. Candidates simultaneously and independently announce their
policy positions. A candidate’s payoff from winning is 1, and from losing is -1. If both candidates receive
the same number of votes, then a coin toss determines the winner of the election. Show that there exists a
unique pure strategy Nash equilibrium, and that in involves both candidates proposals to promise a policy
closest to the median voter.