A Brief Introduction to Game Theory for Marketing · 2017-02-13 · Game: A situation or context in...
Transcript of A Brief Introduction to Game Theory for Marketing · 2017-02-13 · Game: A situation or context in...
1
© Arvind Rangaswamy 2017, All Rights Reserved
February 14-21, 2017
MKTG 555: Marketing Models
A Brief Introduction to Game Theory for Marketing
2
© Arvind Rangaswamy 2017, All Rights Reserved
Basic Definitions
Game: A situation or context in which players (e.g., consumers, firms)
make strategic decisions that take into account each other’s actions
and responses.
Strategy: A rule or plan of action for playing a game. Each player has
a strategy 𝒔𝒊.
Strategy profile/vector: A rule or plan of action for all players in the
game (s1, s2, s3, si, …..sN).
Payoff: The value (e.g., utility, dollars) associated with a possible
outcome in the game. Each player (i) has his/her own payoff in a
game.
Optimal strategy: For each player, the strategy (𝒔𝒊∗) that maximizes
that player’s expected payoff.
3
© Arvind Rangaswamy 2017, All Rights Reserved
Some Types of Non-Cooperative Games
Static Games with Complete Information
Dynamic Games with Complete Information
Static Games with Incomplete (Private) Information
Simple Dynamic Games with Incomplete Information
(Signaling Games)
4
© Arvind Rangaswamy 2017, All Rights Reserved
Some Types of Non-Cooperative Games
Static Games with Complete Information
Dynamic Games with Complete Information
Static Games with Incomplete (Private) Information
Simple Dynamic Games with Incomplete Information
(Signaling Games)
5
© Arvind Rangaswamy 2017, All Rights Reserved
Concept of Dominant Strategy
Dominant Strategy for firm A: Advertise
Dominant Strategy for firm B: Advertise
Payoff Matrix for an Advertising Game
Firm B Advertise Don’t Advertise
Firm A Advertise (10, 6) (15, 1) Don’t Advertise (7, 8) (10, 3)
6
© Arvind Rangaswamy 2017, All Rights Reserved
Nash Equilibrium
Strategy for firm A: ?
Strategy for firm B: ?
Payoff Matrix for a Second Advertising Game
Firm B Advertise Don’t Advertise
Firm A Advertise (10, 6) (15, 1) Don’t Advertise (7, 3) (20, 8)
A strategy profile (𝒔𝟏∗ , 𝒔𝟐
∗ , … . , 𝒔𝒏∗ ) is a Nash equilibrium, if for each
player i, his choice 𝒔𝒊∗ is the best response to the other players
choices, 𝒔−𝒊∗ .
7
© Arvind Rangaswamy 2017, All Rights Reserved
Nash Equilibrium
Strategy for firm A: ?
Strategy for firm B: ?
Payoff Matrix for a Third Advertising Game
Firm B Advertise Don’t Advertise
Firm A Advertise (10, 10) (2, 15) Don’t Advertise (15, 2) (6, 6)
8
© Arvind Rangaswamy 2017, All Rights Reserved
Nash Equilibrium
Strategy for firm A: ?
Strategy for firm B: ?
Payoff Matrix for a Fourth Advertising Game
Firm B Advertise Don’t Advertise
Firm A Advertise (10, 10) (0, 0) Don’t Advertise (0, 0) (6, 6)
9
© Arvind Rangaswamy 2017, All Rights Reserved
Nash Equilibrium
Strategy for firm A: ?
Strategy for firm B: ?
Payoff Matrix for a Fifth Advertising Game
Firm B Advertise Don’t Advertise
Firm A Advertise (10, 6) (0, 0) Don’t Advertise (0, 0) (6, 10)
10
© Arvind Rangaswamy 2017, All Rights Reserved
Some Types of Non-Cooperative Games
Static Games with Complete Information
Dynamic Games with Complete Information
Static Games with Incomplete (Private) Information
Simple Dynamic Games with Incomplete Information
(Signaling Games)
11
© Arvind Rangaswamy 2017, All Rights Reserved
Subgame-Perfect Nash Equilibrium (from Gibbons 1997)
Two potential Nash equilibria: (L, L′) and (R, R′). Which one will be played?
A Game that Relies on a Noncredible Threat (Gibbons)
L′ R′
L (1, 2) (1, 2) R (0, 0) (2, 1)
12
© Arvind Rangaswamy 2017, All Rights Reserved
Players: 2 firms selling identical products
Strategies: Quantities produced of identical products (substitutes) are 𝒒𝒊 𝐚𝐧𝐝 𝒒−𝒊. Players make their moves simultaneously.
Payoffs:
Cost of production is c per unit
Price: 𝒑 = 𝒂 − 𝒃 𝒒𝒊 + 𝒒−𝒊
𝑷𝒓𝒐𝒇𝒊𝒕𝒊(𝒒𝒊, 𝒒−𝒊) = (𝒑 − 𝒄)𝒒𝒊
𝑷𝒓𝒐𝒇𝒊𝒕−𝒊(𝒒𝒊, 𝒒−𝒊) = (𝒑 − 𝒄)𝒒−𝒊
Cournot Duopoly
13
© Arvind Rangaswamy 2017, All Rights Reserved
a Marginal revenue curve for Monopolist (slope -2b)
c
𝒒𝑴∗
Demand curve (slope –b)
𝒑𝑴∗
𝒒𝑪∗
Basic Econ
𝒒𝑴∗ : 𝐐𝐮𝐚𝐧𝐭𝐢𝐭𝐲 𝐩𝐫𝐨𝐝𝐮𝐜𝐞𝐝 𝐛𝐲 𝐚 𝐦𝐨𝐧𝐨𝐩𝐨𝐥𝐢𝐬𝐭
𝒒𝑪∗ : 𝐐𝐮𝐚𝐧𝐭𝐢𝐭𝐲 𝐩𝐫𝐨𝐝𝐮𝐜𝐞𝐝 𝐮𝐧𝐝𝐞𝐫 𝐩𝐞𝐫𝐟𝐞𝐜𝐭 𝐜𝐨𝐦𝐩𝐞𝐭𝐢𝐭𝐢𝐨𝐧
14
© Arvind Rangaswamy 2017, All Rights Reserved
𝒂 − 𝒄
𝟐𝒃
𝒒𝑴∗ =
𝒂 − 𝒄
𝟐𝒃
𝒒𝑪∗ =
𝒂 − 𝒄
𝒃
𝒂 − 𝒄
𝒃
𝒒𝒊
𝒒−𝒊
𝑩𝑹𝒊−𝟏(𝒒𝒊) =𝒂−𝒄
𝟐𝒃−
𝒒𝒊
𝟐
𝑩𝑹𝒊 𝒒−𝒊 =𝒂−𝒄
𝟐𝒃−
𝒒−𝒊
𝟐
Quantities that produce monopoly profits
Cournot-Nash Equilibrium
Cournot Duopoly
15
© Arvind Rangaswamy 2017, All Rights Reserved
Economic Implications of Different Market Structures
Marginal revenue curve for Monopolist (slope -2b)
Demand curve (slope –b)
𝒂 − 𝒄
𝟐𝒃
𝒒𝑴∗
𝒒𝑪∗
𝒂 − 𝒄
𝒃
𝒒𝒊
𝒒−𝒊
𝑩𝑹𝒊−𝟏 𝒒𝒊 =𝒂−𝒄
𝟐𝒃−
𝒒𝒊
𝟐
𝑩𝑹𝒊 𝒒−𝒊 =𝒂−𝒄
𝟐𝒃−
𝒒−𝒊
𝟐
Cournot-Nash Equilibrium
c
𝒒𝒊∗
𝒒−𝒊∗
𝒒𝒊∗ = 𝒒−𝒊
∗ =𝒂 − 𝒄
𝟑𝒃
𝒒𝑴∗ < 𝒒𝒊
∗ + 𝒒−𝒊∗ < 𝒒𝑪
∗
16
© Arvind Rangaswamy 2017, All Rights Reserved
Players: 2 firms selling identical products
Strategies: Quantities produced of identical products (substitutes) are 𝒒𝒊 𝐚𝐧𝐝 𝒒−𝒊. Player 1 makes the first move, and player 2 then follows (Leader-Follower game)
Payoffs:
Cost of production is c per unit
Price: 𝒑 = 𝒂 − 𝒃 𝒒𝒊 + 𝒒−𝒊
𝑷𝒓𝒐𝒇𝒊𝒕𝒊(𝒒𝒊, 𝒒−𝒊) = (𝒑 − 𝒄)𝒒𝒊
𝑷𝒓𝒐𝒇𝒊𝒕−𝒊(𝒒𝒊, 𝒒−𝒊) = (𝒑 − 𝒄)𝒒−𝒊
Stackelberg Duopoly
17
© Arvind Rangaswamy 2017, All Rights Reserved
𝒒𝑴∗ =
𝒂 − 𝒄
𝟐𝒃
𝒂 − 𝒄
𝟐𝒃
𝒒𝑪∗ =
𝒂 − 𝒄
𝒃
𝒒𝒊
𝒒−𝒊
𝑩𝑹𝒊−𝟏 𝒒𝒊 =𝒂−𝒄
𝟐𝒃−
𝒒𝒊
𝟐
Cournot-Nash Equilibrium
Dynamic Game Backward Induction
Will the Stackelberg Nash equilibrium be the same as the Cournot equilibrium?
Will 𝒒𝒊∗ here be higher than in the Cournot
equilibrium?
18
© Arvind Rangaswamy 2017, All Rights Reserved
Players: 2 (or more) firms selling identical products
Strategies: Price charged 𝒑𝒊 𝐚𝐧𝐝 𝒑−𝒊.
Payoffs:
Cost of production is c per unit
Demand Q = − p; 𝒑 ≤ 𝜶, 𝒑 > 𝟎 𝟎 𝒑 > 𝜶
where: 𝒑 = 𝑴𝒊𝒏(𝒑𝒊, 𝒑−𝒊)
Profiti =
− 𝒑𝒊 𝒑𝒊 − 𝒄 𝒊𝒇 𝒑𝒊 < 𝒑−𝒊 (𝜶−𝒑)
𝟐𝒑 − 𝒄 𝒊𝒇 𝒑𝒊 = 𝒑−𝒊 = 𝒑
𝟎 𝒐𝒕𝒉𝒆𝒓𝒘𝒊𝒔𝒆
Bertrand Competition
19
© Arvind Rangaswamy 2017, All Rights Reserved
c
𝒑𝑯
𝒑𝒊
𝒑−𝒊
𝒑𝑴 𝒑𝑯 =
𝒑𝑴
Bertrand Nash equilibrium
Reaction Functions in Bertrand Price Competition
𝒑𝑴: 𝐌𝐨𝐧𝐨𝐩𝐨𝐥𝐲 𝐩𝐫𝐢𝐜𝐞
𝒑𝑯: 𝐇𝐢𝐠𝐡𝐞𝐬𝐭 𝐟𝐞𝐚𝐬𝐢𝐛𝐥𝐞 𝐩𝐫𝐢𝐜𝐞
c: Unit cost
20
© Arvind Rangaswamy 2017, All Rights Reserved
In an imperfect information game, the players are unaware of the actions chosen by other players. However they know who the other players are, what their possible strategies/actions are, and their preferences/payoffs, i.e., information about the other players in imperfect information is complete.
In incomplete information games, players may or may not know some information about the other players, e.g., their “type”, their strategies, payoffs or their preferences.
Imperfect Vs. Incomplete Games
21
© Arvind Rangaswamy 2017, All Rights Reserved
Balasubramanian Equilibrium Results
(N Retailers + 1 Direct Marketer)
22
© Arvind Rangaswamy 2017, All Rights Reserved
Balasubramanian Equilibrium Results
(N Retailers + 1 Direct Marketer)
23
© Arvind Rangaswamy 2017, All Rights Reserved
Equilibrium Results for Two-Stage Game
Coverage () + Price Competition
24
© Arvind Rangaswamy 2017, All Rights Reserved
Equilibrium Results for Two-Stage Game
Coverage () + Price Competition