david bryce © 1996-2002 adapted from baye © 2002 game theory: the competitive dynamics of strategy...

20
David Bryce © 1996- 2002 Adapted from Baye © Game Theory: The Competitive Dynamics of Strategy MANEC 387 MANEC 387 Economics of Strategy Economics of Strategy David J. Bryce

Post on 18-Dec-2015

216 views

Category:

Documents


0 download

TRANSCRIPT

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

Game Theory: The Competitive Dynamics of Strategy

Game Theory: The Competitive Dynamics of Strategy

MANEC 387MANEC 387

Economics of StrategyEconomics of Strategy

MANEC 387MANEC 387

Economics of StrategyEconomics of Strategy

David J. BryceDavid J. Bryce

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

The Structure of IndustriesThe Structure of Industries

Competitive Rivalry

Threat of newEntrants

BargainingPower of

Customers

Threat ofSubstitutes

BargainingPower of Suppliers

From M. Porter, 1979, “How Competitive Forces Shape Strategy”

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

Competitor ResponseConcepts from Game TheoryCompetitor ResponseConcepts from Game Theory

• Sequential move games in normal form– Simultaneous vs. sequential move games –

hypothetical Boeing v. McDonnell-Douglas game (bullying brothers)

• Sequential move games in extensive form– Backward induction– Subgame-perfect equilibria

• Sequential move games in normal form– Simultaneous vs. sequential move games –

hypothetical Boeing v. McDonnell-Douglas game (bullying brothers)

• Sequential move games in extensive form– Backward induction– Subgame-perfect equilibria

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

Fundamentals of Game TheoryFundamentals of Game Theory1. Identify the players2. Identify their possible actions3. Identify their conditional payoffs from

their actions4. Determine the players’ strategies – My

strategy is my set of best responses to all possible rival actions

5. Determine the equilibrium outcome(s) – equilibrium exists when all players are playing their best response to all other players

1. Identify the players2. Identify their possible actions3. Identify their conditional payoffs from

their actions4. Determine the players’ strategies – My

strategy is my set of best responses to all possible rival actions

5. Determine the equilibrium outcome(s) – equilibrium exists when all players are playing their best response to all other players

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

Simultaneous-Move BargainingSimultaneous-Move Bargaining

• Management and a union are negotiating a wage increase

• Strategies are wage offers & wage demands• Successful negotiations lead to $600 million

in surplus, which must be split among the parties

• Failure to reach an agreement results in a loss to the firm of $100 million and a union loss of $3 million

• Simultaneous moves, and time permits only one-shot at making a deal.

• Management and a union are negotiating a wage increase

• Strategies are wage offers & wage demands• Successful negotiations lead to $600 million

in surplus, which must be split among the parties

• Failure to reach an agreement results in a loss to the firm of $100 million and a union loss of $3 million

• Simultaneous moves, and time permits only one-shot at making a deal.

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

The Bargaining Game in Normal FormThe Bargaining Game in Normal Form

UnionUnionM

an

ag

em

en

tM

an

ag

em

en

t 500 -3 -3

100 -100 -100

-3 300 -3

-100 300 -100

-3 -3 100

-100 -100 500

W=$10W=$10 W=$5W=$5 W=$1W=$1W

=$

10

W=

$1

0W

=$

5W

=$

5W

=$

1W

=$

1

**

**

**

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

“Fairness” – the Natural Focal Point“Fairness” – the Natural Focal Point

UnionUnionM

an

ag

em

en

tM

an

ag

em

en

t 500 -3 -3

100 -100 -100

-3 300 -3

-100 300 -100

-3 -3 100

-100 -100 500

W=$10W=$10 W=$5W=$5 W=$1W=$1W

=$

10

W=

$1

0W

=$

5W

=$

5W

=$

1W

=$

1

**

**

**

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

Lessons in Simultaneous-Move BargainingLessons in Simultaneous-Move Bargaining

• Simultaneous-move bargaining results in a coordination problem

• Experiments suggests that, in the absence of any “history,” real players typically coordinate on the “fair outcome”

• When there is a “bargaining history,” other outcomes may prevail

• Simultaneous-move bargaining results in a coordination problem

• Experiments suggests that, in the absence of any “history,” real players typically coordinate on the “fair outcome”

• When there is a “bargaining history,” other outcomes may prevail

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

A Sequential Game - Single Offer BargainingA Sequential Game - Single Offer Bargaining

• Now suppose the game is sequential in nature, and management gets to make the union a “take-it-or-leave-it” offer

• Write the game in extensive form – Summarize the players – Their potential actions – Their information at each decision point – The sequence of moves and – Each player’s payoff

• Now suppose the game is sequential in nature, and management gets to make the union a “take-it-or-leave-it” offer

• Write the game in extensive form – Summarize the players – Their potential actions – Their information at each decision point – The sequence of moves and – Each player’s payoff

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

MM

1010

55

11

Step 1: Management’s MoveStep 1: Management’s Move

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

AcceptAccept

RejectReject

Step 2: Append the Union’s MoveStep 2: Append the Union’s Move

MM

1010

55

11

AcceptAccept

RejectReject

UU

UU

AcceptAccept

RejectRejectUU

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

100, 500100, 500

-100, -3-100, -3

300, 300300, 300

-100, -3-100, -3

500, 100500, 100

-100, -3-100, -3

Step 3: Append the PayoffsStep 3: Append the Payoffs

AcceptAccept

RejectReject

MM

1010

55

11

AcceptAccept

RejectReject

UU

UU

AcceptAccept

RejectRejectUU

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

100, 500100, 500

-100, -3-100, -3

300, 300300, 300

-100, -3-100, -3

500, 100500, 100

-100, -3-100, -3

Multiple Nash EquilibriaMultiple Nash Equilibria

AcceptAccept

RejectReject1010

55

11

AcceptAccept

RejectReject

AcceptAccept

RejectReject

**

MM

UU

UU

UU

**

**

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

Step 7: Find the Subgame Perfect Nash Equilibrium Outcomes

Step 7: Find the Subgame Perfect Nash Equilibrium Outcomes

• Outcomes where no player has an incentive to change its strategy at any stage of the game, given the strategy of the rival, and

• The outcomes are based on “credible actions;” that is, they are not the result of “empty threats” by the rival.

• Outcomes where no player has an incentive to change its strategy at any stage of the game, given the strategy of the rival, and

• The outcomes are based on “credible actions;” that is, they are not the result of “empty threats” by the rival.

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

• Final player chooses the option that maximizes her payoff

• The previous player chooses the option that maximizes his payoff conditional on the expected choice of the final player, and so on

• This is backward induction – work backward from the end “sub-game,” each player makes optimal choices assuming that each subsequent rival chooses rationally

• The equilibrium is called sub-game perfect

• Final player chooses the option that maximizes her payoff

• The previous player chooses the option that maximizes his payoff conditional on the expected choice of the final player, and so on

• This is backward induction – work backward from the end “sub-game,” each player makes optimal choices assuming that each subsequent rival chooses rationally

• The equilibrium is called sub-game perfect

Sequential Strategies in the Game TreeSequential Strategies in the Game Tree

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

Only One Subgame-Perfect Nash Equilibrium OutcomeOnly One Subgame-Perfect Nash Equilibrium Outcome

100, 500100, 500

-100, -3-100, -3

300, 300300, 300

-100, -3-100, -3

500, 100500, 100

-100, -3-100, -3

AcceptAccept

RejectReject1010

55

11

AcceptAccept

RejectReject

AcceptAccept

RejectReject

MM

UU

UU

UU**

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

Re-CapRe-Cap

• In take-it-or-leave-it bargaining, there is a first-mover advantage.

• Management can gain by making a take-it or leave-it offer to the union.

• Management should be careful, however; real world evidence suggests that people sometimes reject offers on the the basis of “principle” instead of cash considerations.

• In take-it-or-leave-it bargaining, there is a first-mover advantage.

• Management can gain by making a take-it or leave-it offer to the union.

• Management should be careful, however; real world evidence suggests that people sometimes reject offers on the the basis of “principle” instead of cash considerations.

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

Moroni, Zarahemna and Credible ThreatsMoroni, Zarahemna and Credible Threats

MMSpareSpare

AttackAttack

-200-200

-50 -50

200200

-150-150

MMSpareSpare 100100

-100 -100

00

-200-200

ZZ

Deliver/Oath

Deliver/Oath

Don’t Deliver

Don’t Deliver

PayoffsPayoffs

AttackAttack

**

See Alma 44, Book of Mormon

(or Bush, Saddam and those pesky WMDs)

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

Moroni – Zarahemna and Credible ThreatsMoroni – Zarahemna and Credible Threats

MMSpareSpare

AttackAttack

-200-200

-50 -50

200200

-150-150

MMSpareSpare 100100

-100 -100

00

-200-200

ZZ

Take Oath

Take Oath

Don’t Deliver

Don’t Deliver

PayoffsPayoffs

AttackAttack

**ZZ Don’t Take

Don’t TakeMM

SpareSpare

AttackAttack

DeliverDeliver

??100100

-175-175 -100-100

See Alma 44, Book of Mormon

David Bryce © 1996-2002Adapted from Baye © 2002

David Bryce © 1996-2002Adapted from Baye © 2002

Summary and TakeawaysSummary and Takeaways

• The reasoning of game theory supplies a useful way to predict the outcome of competitive interactions

• By diagramming a game, players can identify their best potential strategies

• Threats of retaliation must be credible• Incumbents may be able to deter

entrants by making major strategic commitments (credible threats)

• The reasoning of game theory supplies a useful way to predict the outcome of competitive interactions

• By diagramming a game, players can identify their best potential strategies

• Threats of retaliation must be credible• Incumbents may be able to deter

entrants by making major strategic commitments (credible threats)