Topic - 13 - Strategy Over Time
Topic - 13 - Strategy Over Time
3
Repeated Game
⚫ A tit-for-tat strategy for repeated prisoners’
dilemma games sets cooperation in the 1st
round (High Price, High Price) then copies
the rival’s previous action in each subsequent
round.
⚫ If a rival defects from a collusive outcome at
time t, that can trigger a punishment at time
t+1. Tit for tat is one example of such a
trigger strategy.
4
Repeated Games
⚫A Tit-for-Tat may not induce cooperation in a
repeated game if the extra profit in period t from
defection (that is, 110-50=60 in Slide #3) is greater
than the loss from the punishment in period t + 1
(=50-10 = 40).
⚫However, if the tit-for-tat strategy is modified to
extend the punishment for more than one period,
then it may ensure cooperation.
The extension should be enough to more than
compensate the one time extra profit.
Repeated Game: Tit-for-Tat
⚫ What if the game is infinitely repeated?
Tit-for-tat strategy is rational in this case. If
a competitor undercuts its rival, it will get
high profits that month but knows the rival
will lower price next month. As a result both
will get lower profits. So it is not rational to
undercut.
Thus such trigger strategy may lead to
cooperative Nash outcome that is best for
both. Such tacit collusions are legal.
6
Repeated Game: Tit-for-Tat
⚫ Thus in an infinitely repeated game,
prisoners dilemma can have cooperative
outcome (but not necessarily).
⚫ Cooperation may fail due to regulation,
bounded rationality or if future profits are less
important (that is discount rate is high).
⚫ For cooperation the present value of extra
profits earned in the future from cooperation
must be higher than one time profits from
defection.
7
Finite Game
⚫ What if the game is repeated a finite number
of times once every month?
After the last month, there is no retaliation
possible. But in the month before last
month, knowing that the rival would charge
low price in last month, it will charge low
price in month before.
Keep going backwards and see that only
rational outcome is for both firms to charge
low price every month.
8
13.2 Sequential Games
⚫ Players move in turn, responding to each
other’s actions and reactions.
Example: Stackelberg model
Responding to a competitor’s
advertisement campaign.
Entry decisions.
Responding to a regulatory policy.
9
Sequential Game
⚫ In the product choice game, if both the firms
announce their decisions simultaneously,
there is multiple Nash equilibrium.
⚫ What if firm 1 speed up production and
introduce new cereal first?
⚫ In this sequential game, Firm 1 (the leader)
considers firm 2’s (follower) potential reaction
before making its own choice (Stackelberg
Model).
10
Payoff Matrix
Firm 2
Crispy Sweet
11
Product Choice Game in Extensive
Form
(Firm 1, Firm 2)
Crispy -5, -5
Crispy Firm 2
Sweet 10, 20
Firm 1
Crispy 20, 10 X
Sweet Firm 2
Sweet -5, -5
12
Sequential Games
⚫ In the extensive form of this game, there is a
unique Nash equilibrium (Note: in the normal
form there is multiple Nash equilibrium).
If Firm 1 chooses Crispy, Firm 2 chooses
Sweet (20 vs. -5).
On the other hand, if Firm 1 chooses
Sweet, Firm 2 chooses Crispy (10 vs. -5).
13
Sequential Games
⚫ The Advantage of Moving First
In this product-choice game, there is a
clear advantage to moving first.
Firm 1 by choosing “sweet” can force firm 2
to choose “Crispy” so that Firm 1 can get
$20. Note that if firm 1 chooses Crispy, it
ends up with $10.
So (Firm 1, Firm 2) = (Sweet, Crispy) is the
subgame perfect Nash equilibrium.
14
Sequential Games: United vs.
American
A, U
48
5, 5
United
48 64
4, 6
American
64 48 6, 4
United
64
1, 1
16
Sequential Games: United Vs.
American
⚫ If United can chose first (leader), then the
Nash equilibrium changes to (American,
United) = (48, 64) and United will make more
$64. Thus clearly the leader has an
advantage in a sequential game.
⚫ Thus when a game with multiple Nash
equilibrium in normal form (simultaneous
game) is played sequentially, we have unique
Nash equilibrium. This Nash equilibrium
changes depending on who is the leader.
17
Sequential Games: United Vs.
American
⚫ However, if both the players have dominant
strategies in simultaneous game, then playing
the game sequentially would not change the
Nash equilibrium irrespective of who is the
leader.
⚫ Consider a Prisoner’s Dilemma game. If this
game is played sequentially, the Nash
equilibrium does not change irrespective of
who moves first.
18
Sequential Game
Firm B
No Ad Ad
No Ad 2, 2 0, 3
Ad 3, 0 1, 1
19
Sequential Games
A, B
NO 2, 2
Firm B
NO AD
0, 3
Firm A
3, 0
AD NO
Firm B
AD
1, 1
24
13.3 Entry Deterrence
⚫ An incumbent gas station (at a highway exit)
can pay $b to the landlord to have exclusive
right to be the only gas station. In this case it
can monopolize the market and earn 10 – b,
where monopoly profits = 10.
⚫ If it does not pay $b, the potential entrant can
enter in which case it has to play Cournot
game with the entrant and earn Cournot profits
Πd = $4. The entrant (with identical MC) gets 4
– F, where F is the fixed cost of entry.
25
Paying to Prevent Entry
Entry Deterrence
⚫ Blockaded Entry: If F > 4, the potential
entrant would not enter even if the incumbent
fails to get an exclusive right. The Nash
equilibrium is (Don’t Pay, Don’t Enter).
⚫ Deterred Entry: If F < 4 and 10 – b > 4, then
Incumbent will pay $b to exclude the potential
entrant. The Nash equilibrium is (Pay, Don’t
Enter).
⚫ Accommodated Entry: If F < 4 and 10 – b <
4, the Nash equilibrium is (Don’t Pay, Enter).
27
13.4 Investing to Deter Entry
⚫ An incumbent (monopoly) may invest in
equipment even if the cost savings may not
justify investment, if it can deter entry.
⚫ Looking at the incumbent’s choice, the
potential entrant decides whether or not to
enter the market.
⚫ In the example (next slide), if incumbent
doesn’t invest, the potential entrant enters
($4 > 0). If the incumbent invests, the entrant
doesn’t enter (0 > -1).
28
Investing to Deter Entry
Inc, Ent
NO 10, 0
Entrant
Enter
No Inv
4, 4
Incumbent
8, 0
Invest NO
Entrant Enter
2, - 1
sign
Don't 40, 18
Player 1
Sign 18, 40
don't sign
player 2
Don't 30, 30
33
Clicker Q# 4
36
Hold Up Problem
37
Minimizing Hold Ups
38
Moving Too Quickly
39
Moving Too Quickly
40