Exercises 2 - Solutions
Exercises 2 - Solutions
If Player 2 chooses strategy M, Player 1 chooses strategy A, and if Player 1 chooses strategy
A, Player 2 chooses strategy M. Therefore, (A,M) is a Nash equilibrium.
Note that, since we eliminated also the weakly dominated strategies, one of the Nash
equilibria (C,L)=(3,2) is eliminated and the other becomes the result of the iterative
elimination procedure.
(C,L) =(3,2) pareto dominates each of the other outcomes in the game. So, it is the only
pareto-optimal outcome.
2.
Player 2
L M R
A -3,2 -1,4 -2,0
Player 1 B 4,1 -1,0 2, x
C 0,4 3,-1 1,2
Besides (B,R) = (2,x), none of the outcomes other than (B,L) =(4,1) has the potential to be
a Nash equilibrium. So, in order for (B,R) to be the unique Nash equilibrium of the game,
Player 2 needs to diverge to R if Player 1 plays B. For that, x needs to be greater than 1.
Ahmet
swim hike
swim 2,2 0,0
Melis hike 0,0 1,1
No. Melis chooses to swim if Ahmet swims and she chooses to hike if Ahmet hikes. The
same is true also for Ahmet. That is, none of the players has a dominant strategy, so the
game lacks a dominant strategy equilibrium.
c) Is there a Nash equilibrium of the game?
There are two Nash equilibria of the game: (swim, swim)= (2,2) and (hike,hike)=(1,1)
There is only one pareto efficient outcome of the game: (swim, swim). It pareto dominates
every other outcome.
Player 2
Heads Tail
Heads 1,-1 -1,1
Player 1 Tail -1,1 1,-1
No because if Player 2 chooses Heads Player 1 chooses Heads but if Player 2 chooses Tails,
then Player 1 chooses Tails. So, Player 1 does not have a dominant strategy. Similarly, we
can show that Player 2 does not have a dominant strategy either. Hence, the game lacks a
dominant strategy equilibrium.
There is no Nash equilibrium in this game. At each outcome, one of the players diverge for
another outcome.
None of the outcomes in the game is pareto dominated by another outcome. So, all
outcomes are pareto efficient.