Professional Documents
Culture Documents
Strategic Thinking - Sumit Roy
Strategic Thinking - Sumit Roy
4
John Maynard Smith
What is a Game?
12-6
Basic Concepts
8
The Heinz Dilemma
12
The mind of the strategist
• “Successful business strategies result not
from rigorous analysis, but from a particular
state of mind.”
• Strategy making is in essence a creative and
partly intuitive process, often disruptive of
the status quo.
• Strategists employ analysis only to stimulate
the creative process, to test the ideas that
emerge, to work out their strategic
implications or to ensure successful
execution.
13
Boeing-Airbus game
Airbus
Do not
Develop
develop
Decision Agenda What effects can I create given these What means ought I accumulate to
means? achieve these goals?
Underlying To the extent that we can control the To the extent that we can predict the
Logic future we do not need to predict it. future, we can control it.
Basis for Can. Do what you are able to do Should. Commit based on rational
Commitment choices from analysis & maximization
Predisposition Affordable Loss. Control downside – Expected Return. Pursue (risk adjusted)
Toward Risk avoid fatal risk, pursue zero resources maximum predicted opportunity
to market
New
Goals means
Who I am
What I know What can Call people Stakeholder
Whom I know I do? I know commitments
(Self-efficacy) (Docility) (Creativity)
Means New
goals
12-28
Thinking Strategically: Iterative
Deletion of Dominated Strategies
• Even if the strategy to choose is not obvious, one can
sometimes identify strategies a player will not choose
• A strategy is dominated if there is some other strategy
that yields a strictly higher payoff regardless of others’
choices
• No sane player will select a dominated strategy
• Dominated strategies are irrelevant and can be
removed from the game to form a simpler game
• Look again for dominated strategies, repeat until there
are no dominated strategies left to remove
• Sometimes this allows us to solve games even when
no player has a dominant strategy
12-29
Nash Equilibrium in
One-Stage Games
• Concept created by mathematician John Nash,
published in 1950, awarded Nobel Prize
• Has become one of the most central and important
concepts in microeconomics
• In a Nash equilibrium, the strategy played by each
individual is a best response to the strategies played by
everyone else
• Everyone correctly anticipates what everyone else will do and
then chooses the best available alternative
• Combination of strategies in a Nash equilibrium is stable
• A Nash equilibrium is a self-enforcing agreement:
every party to it has an incentive to abide by it,
assuming that others do the same
12-30
Nash Equilibria in Games with
Finely Divisible Choices
• Concept of Nash equilibrium also applies to
strategic decisions that involve finely divisible
quantities
• To find the Nash Equilibrium:
• Determine each player’s best response function
• A best response function shows the relationship
between one player’s choice and the other’s best
response
• A pair of choices is a Nash equilibrium if it satisfies
both response functions simultaneously
12-31
Mixed Strategies
• When a player chooses a strategy without randomizing
he is playing a pure strategy
• Some games have no Nash equilibrium in pure
strategies. In these cases, look for equilibria in which
players introduce randomness
• A player employs a mixed strategy when he uses a
rule to randomize over the choice of a strategy
• Virtually all games have mixed strategy equilibria
• In a mixed strategy equilibrium, players choose
mixed strategies and the strategy each chooses is a
best response to the others players’ chosen strategies
12-32
Games with Multiple Stages
12-33
Thinking Strategically:
Backward Induction
• To solve a game with perfect information
• Player should reason in reverse, start at the end of the tree
diagram and work back to the beginning
• An early mover can figure out how a late mover will react, then
identify his own best choice
• Backward induction is the process of solving a
strategic problem by reasoning in reverse
• A strategy is one player’s plan for playing a game, for
every situation that might come up during the course of
play
• One can always find a Nash equilibrium in a multi-stage
game of perfect information by using backward
induction
12-34
Cooperation in Repeated Games
12-35
Repeated Games: Equilibria With
Cooperation
• If the repeated game has no fixed stopping
point, cooperation is possible
• One way to achieve this is through both
players using grim strategies
• With grim strategies, the punishment for
selfish behavior is permanent
• A credible threat of permanent punishment for
non-cooperative behavior can be strong
enough incentive to foster cooperation
12-36
Asymmetric Information
UNDERLYING STRUCTURES
What sort of structures or processes might
explain what’s been happening?
MENTAL MODELS
What is the thinking that creates or allows these
structures, patterns and events to occur?
41