Game Theory 101 (#7): Mixed Strategy Nash Equilibrium and Matching Pennies

Introduction to Mixed Strategy Nash Equilibrium

In this section, the speaker introduces the concept of mixed strategy Nash equilibrium and discusses the game "Matching Pennies" as an example.

Game Description

• The game "Matching Pennies" involves two players simultaneously revealing a penny.

• If both pennies show heads or tails, one player wins and the other loses $1.

• If the pennies mismatch (one shows heads and the other shows tails), the roles are reversed.

Payoff Matrix

• The payoff matrix for "Matching Pennies" is presented, showing that each outcome adds up to zero-sum.

• Players have diametrically opposed interests in this game.

Lack of Pure Strategy Nash Equilibria

• It is explained why there are no pure strategy Nash equilibria in this game.

• Each possible combination of strategies can be deviated from by one player to improve their outcome.

Introduction to Mixed Strategy Nash Equilibrium

• The concept of mixed strategy Nash equilibrium is introduced as an alternative solution.

• John Nash's theorem states that if no equilibrium exists in pure strategies, there must be at least one in mixed strategies.

• A mixed strategy involves players randomly choosing among their available options based on a probability distribution.

Example: Matching Pennies with a Mind Reader Opponent

• An example scenario is presented where a player is playing against a mind reader opponent in Matching Pennies.

• To avoid losing against the mind reader, it is suggested to flip the coin randomly since the opponent cannot predict random outcomes accurately.

Randomizing with Probability 0.5

The speaker discusses the concept of randomizing with a probability of 0.5, where there is an equal chance of heads or tails when flipping a coin.

Randomizing Outcomes

• When randomizing with a probability of 0.5, it doesn't matter whether you choose heads or tails.

• Choosing heads will result in winning half the time and losing half the time.

• Choosing tails will result in losing half the time and winning half the time.

• Both players are stuck in a situation where they cannot change their strategies to improve their outcomes.

• This creates a mutual best response and leads to a Nash equilibrium.

Coin Flipping Strategy

The speaker explains that guessing the coin flipping strategy is not easy and introduces the need for a mixed strategy algorithm to solve such situations.

Payoff Matrix Complexity

• Changing strategies based on simply looking at the payoff matrix is not straightforward.

• Different outcomes have different values associated with them (e.g., winning/losing different amounts).

• It is not possible to determine if flipping the coin will lead to favorable outcomes without considering opponent's strategies.

Mixed Strategy Algorithm

• To solve for this type of situation, a mixed strategy algorithm is needed.

• In future videos, more depth will be provided on pure strategy Nash equilibrium, mixed strategy Nash equilibrium, and how to use the mixed strategy algorithm effectively.

The transcript does not provide further details on these topics beyond what has been mentioned above.