Professional Documents
Culture Documents
STRATEGIC THINKING
Exercises on Nash Equilibrium and Mixed
Equilibrium
Pierpaolo Battigalli
Bocconi University
A.Y. 2006-2007
Abstract
The number of stars denotes the di¢ culty of the exrercise:
(*) easy
(**) medium
(***) di¢ cult
where Q = q1 + q2 . Assume further that each …rm has constant marginal costs
(and consequently constant average costs). In particular, assume that marginal
cost is equal to c < a.
1
(1) (*) Find the quantity that a monopolist would produce in such a market
and denote this quantity with QM .
(2) (*) Represent this Cournot duopoly as a non-cooperative game static
game. Find the reaction function (i.e. best response to deterministic conjec-
tures) of each …rm. Is the restriction to deterministic conjectures without loss of
generality? [Hint: Think of something you have proved in the previous problem
sets].
(3) (*) Is the game symmetric? Does it have a symmetric Nash equilibrium?
Find the Cournot-Nash equilibrium (i.e. the Nash equilibrium of this game)
(4) (**) Consider a generic …rm i. Can any qi > QM be rational for …rm i?
[Hint: Fix a qi0 > QM . Is qi0 dominated (strictly) by some qi QM ?]
(5) (***) Given the answer to point (4), what action pro…les are consistent
with R \ B (R)? What are the rationalizable action pro…les?
(6) (***) Suppose that a new …rm (say …rm 3) joins the market (then Q =
q1 + q2 + q3 ). Firm 3 has the same production technology of the other two
…rms (thus, the marignal costs of …rm 3 are constant and equal to c). Find
the Cournot-Nash equilibrium of this oligopoly. Find the set of rationalizable
outcomes. [Hint: check whether the set [0; QM ]3 has the best reply property.]
Formulate this situation as a strategic game and show that in all Nash equi-
libria one of the players concedes immediately
2
(2.1) ai is never a best response to b
[any deterministic conjecture a i 2A i
(i.e. ai 2 b b
= ri (A i ), with ri (A i ) := ri (a i )),
a b
i 2A i
Exercise 5 (*)
Find the (pure and) mixed equilibria of the following game:
a b c
A 2; 0 0; 5 2; 0
B 5; 5 1; 2 0,0
C 0; 0 1; 2 5; 5
D 1; 2 6; 1 1; 2
[Hint: the smart way to do this is to …nd the rationalizable actions …rst.]
S C D
s x; x x; 0 x; 0
m 0; x 2; 0 0,2
g 0; x 0; 2 2; 0
Find the equilibria (pure and mixed), showing how the set of equilibria depends
on the parameter x 2 (0; 2). In particular discuss the di¤erence between the
case x < 1 and the case x > 1:
3
(4) For the symmetric mixed equilibrium, compute the probability that at
least one person calls for help (i.e. the probability that the pedestrian receives
immediate medical treatment) showing how it depends on the parameter n. Is
this comparative static result surprising?
Exercise 8 (**) Prove that every …nite game has at least one mixed equi-
librium such that all weakly dominated strategies have zero probability.
[Hint: Let G be the original game and G0 be the game obtained by deletion
of weakly dominated strategies, what is the relationship between equilibria of
G0 and equilibria of G?]
where
k k
i + max 0; (ui (ei ; i) ui ( ))
fik ( ) = P m=mi m ;
1 + m=1 max [0; (ui (ei ; i) ui ( ))]
is a mixed action pro…le, (eki ; i ) is a mixed pro…le obtained from if player
i chooses pure action aki 2 Ai = fa1i ; :::am k
i g with probability 1 (ei 2 R
i mi
is the
unit vector with 1 in place k and 0 elsewhere).]
4
of i. The exercise is conceptual. It is based on the understanding of abstract
de…nitions and on some basic results about best replies.
Suppose that each player i in a …nite two-player game is characterized by
two variables: his action ai and his probabilistic beliefs about (1) the action of
j and (2) the conjecture of j. The conjecture of i on the action of j is obtained
from those probabilistic beliefs by computing marginal distributions.
More formally, the state of player i is a pair si = (ai ; i ) 2 Ai (Aj (Ai )).
A state is a pair of states for the two players, i.e. an element s = (a1 ; 1 ; a2 ; 2 ) 2
A1 (A2 (A1 )) A2 (A1 (A2 )). The conjecture of i in state
s = (a1 ; 1 ; a2 ; 2 ) is the marginal probability measure is =margAj i , that is
i i j
s (aj ) = (a0j ; ) 2 Aj (Ai ) : a0j = aj :
j
Player i in state s = (a1 ; 1 ; a2 ; 2 ) is certain that the conjecture of j is if
n j
o
i
(aj ; j ) 2 Aj (Ai ) : j = = 1.