EC941 - Game Theory: Prof. Francesco Squintani Email: F.squintani@warwick - Ac.uk
EC941 - Game Theory: Prof. Francesco Squintani Email: F.squintani@warwick - Ac.uk
Lecture 6
3, 1, 1 4, 0, 2
3 3
1
R U O
The two decision subhistory of player 2 are linked,
to account for the2 fact that she does not know player
1’s prior action. 2,
S F S F 5
3, 1, 1 4, 0, 2
3 3
Extensive Form Game
Definition An extensive game with imperfect information and chance
moves consists of
a set of players
a set of sequences (terminal histories) with the property that no
sequence is a proper subhistory of any other sequence
a function (the player function) that assigns either a player or
“chance” to every sequence that is a proper subhistory of some
terminal history
a probability distribution (the chance move) over the actions
available after any history to which the player function assigns
chance. The probability distributions are independent.
for each player, a partition (the player’s information partition) of
the set of histories assigned to that player by the player function
for each player, preferences over the set of terminal histories.
3, 1, 1 4, 0, 2
3 3
1
R
The Nash Equilibrium U F) is notOa Perfect
(O,
Bayesian
2
Equilibrium, because the strategy F is not optimal,
2, {U,
regardless of 2’s beliefs at the information set
S
R}. F S F 5
3, 1, 1 4, 0, 2
3 3
Spence Signalling Model
There is one student and two firms.
The K intervals are [t0, t1), [t1, t2), …, [tK-1, tK], where
t0=0 and tK=1.
For any k = 1, …, K-1, all expert types t in [tk-1, tk)
send the same report rk.
Hence, upon receiving report rk, the DM knows that t
is in [tk-1, tk), and chooses y so as to maximize
tk
- (y-t)2 dt
tk-1
tk
Taking the first-order condition, 0 = - 2 (y-t) dt
= - 2[ y - (tk-1+tk)/2 ]. tk-1
So, upon receiving report rk, the DM chooses the
action y = (tk-1+ tk)/2.
In a PBE, the expert anticipates that if reporting r =
rk, she induces the action y = (tk-1+ tk)/2.
For any k = 1, …, K-1, an expert of type tk must be
indifferent between sending report rk and rk+1.
I.e., - ((tk-1+ tk)/2 -(tk + b))2 = - ((tk+ tk+1)/2 -(tk + b))2.
Or, tk+1 - tk = tk – tk-1 +4b.
If these conditions hold, then, for any k = 1, …, K,
every type of expert t in [tk-1, tk) prefers to send
report r = rk than any other report.
The conditions give a second-order difference
equation, solved with boundary conditions t0 = 0 and
tK = 1.
The interval [tk-1, tk) has length tk – tk-1 = t1 + (k-1)4b.
The sum of the intervals [tk-1, tk), for k = 1, …, K,
must be equal to 1:
t1 + (t1 +4b) + … + [t1 +(K-1)4b] = 1.
Or, Kt1 + 4b [1+ … + (K-1)b] = 1.
I.e., Kt1 + 2bK(K-1) = 1.
So, if b is small enough that 2bK(K-1) < 1, then
there is a value of t1 that satisfies the condition, and
hence a PBE with K intervals.
The largest is b, the smallest is the maximum number
of intervals K* that can be a PBE.
For b> 1/4, K* = 1. For 1/4 < b < 1/12, K* =2, etc.
We conclude by ranking PBE in ex-ante sense
(i.e., before the state t is realized).
The sender’s ex-ante equilibrium payoff is:
- Σ Pr{t in [tk-1, tk)}
[ (tk-1+tk)/2 - (t+b)]2dt /Pr[tk-1, tk).
The decision maker’s
K tk ex-ante equilibrium payoff is:
- Σ Pr{t in [tk-1, tk)} [ (tk-1+tk)/2 - t]2dt /Pr[tk-1, tk).
k=1 tk-1
K tk
k=1 tk-1
Expanding the sender’s ex-ante equilibrium payoff,
k=1 tk-1
tk
tk-1
In sum, the sender’s and the decision maker’s ex-
ante equilibrium payoff differ only by the constant
b2.
The PBE maximizing one, maximizes also the other.
It can be shown that, for any b, the PBE maximizing
ex-ante payoff is the one with K* intervals.
This is because the sum of the loss terms in the ex-
ante payoff expression is larger, the coarser is the
equilibrium partition.
Summary of the Lecture