Zach's Math Zone · YouTube · 5:15
This video segment introduces the method for calculating a mixed strategy Nash equilibrium in a 2x2 game. It defines mixed strategies using probabilities p and q for Player 1 and Player 2, respectively. The core principle explained is that players must be indifferent between their pure strategies in equilibrium. The instructor then demonstrates how to calculate the expected payoff for Player 1's 'Up' and 'Down' strategies based on Player 2's probability q, deriving the expressions and 4 - 3q. The segment concludes by stating the next step is to set these expected payoffs equal to solve for q. This 150-second whiteboard segment works through a 2x2 game-theory example to find mixed-strategy probabilities. It first uses Player 1's expected payoffs to solve , then clears space and uses Player 2's expected payoffs to solve . The key method is the indifference condition: set a player's two pure-strategy expected payoffs equal and solve for the opponent's mixing probability. This 15-second excerpt shows the end of a worked 2x2 game-theory example on a blackboard. The payoff matrix and the algebra for Player 2's expected payoffs are already visible, with and boxed in red. The narration explains that is the probability that makes Player 2 indifferent between Up and Down because both give the same expected payoff, and concludes that this is how one finds a mixed strategy Nash equilibrium.
Use the learning inspector for key ideas and moments, or open the reading tabs for the complete notes.
Generated from the video's visuals and explanation; not verbatim speech.
The video begins by presenting a 2x2 payoff matrix for a game involving Player 1 and Player 2. Both players have two pure strategies: Up and Down. The concept of a mixed strategy is introduced, where Player 1 plays Up with probability and Down with probability , while Player 2 plays Up with probability and Down with probability . Visual highlights circle these probabilities and strategy labels on the matrix to emphasize the setup.
The instructor states the fundamental principle for finding a mixed strategy Nash equilibrium: we must determine the specific values of and that render each player completely indifferent between their available pure strategies. This means the expected payoff from playing one strategy must exactly equal the expected payoff from playing the other.
Focusing first on Player 1, the video demonstrates how to calculate the expected payoff for choosing the Up strategy. By multiplying Player 1's payoff of 2 by Player 2's probability of playing Up (), and adding the payoff of 1 multiplied by Player 2's probability of playing Down (), the expression is formed. Algebraic simplification yields the final expected payoff of .
Next, the expected payoff for Player 1 choosing the Down strategy is calculated. Player 1 receives a payoff of 1 when Player 2 plays Up (probability ), and a payoff of 4 when Player 2 plays Down (probability ). This gives the equation . Expanding and combining like terms simplifies this expected payoff to .
With both expected payoff functions for Player 1 now established in terms of , the instructor reiterates the goal: to find the exact value of that makes Player 1 indifferent between playing Up and Down. The segment concludes by setting up the logical next step, which is to equate the two derived payoff expressions, and , to solve for the equilibrium probability.
The clip opens with the payoff matrix already on the left and Player 1's two expected-payoff formulas on the right: and . The instructor now applies the indifference condition by asking for the value of that makes these two expressions equal.
He writes , then rearranges step by step. Adding to both sides and subtracting gives , and dividing by yields . This is the probability with which Player 2 must play Up so that Player 1 receives the same expected payoff from Up and Down.
The interpretation is stated explicitly: when , Player 1 is indifferent between the two pure strategies. That does not mean the payoff is zero; it means both actions give the same expected value, so randomizing between them is consistent with equilibrium behavior.
The board is then cleared to make room for the second half of the calculation, while the boxed result remains visible at the top. The next task is to find , the probability with which Player 1 plays Up.
To compute Player 2's expected payoff from Up, the instructor reads the relevant column of payoffs from the matrix: when Player 1 plays Up and when Player 1 plays Down. Weighting these by and gives , which simplifies to .
For Player 2's expected payoff from Down, the relevant payoffs are when Player 1 plays Up and when Player 1 plays Down. Thus .
Again the indifference condition is used, now for Player 2: set the two expected payoffs equal, . Moving terms gives , so . This is the probability with which Player 1 must play Up to make Player 2 indifferent between Up and Down.
The final boxed result is written beside the earlier boxed . Together these are the mixed-strategy probabilities obtained from the two indifference equations for the displayed game.
The board presents a completed 2x2 game example. On the left is the payoff matrix with Player 1's rows labeled (p) Up and (1-p) Down, and Player 2's columns labeled (q) Up and (1-q) Down. The four payoff pairs are (2,-3), (1,2), (1,1), and (4,-1). On the right, the worked algebra gives Player 2's expected payoffs as and . The equilibrium probabilities and are highlighted in red boxes.
The speaker interprets the solved value : it is the probability with which Player 1 must choose Up so that Player 2 becomes indifferent between Up and Down. Indifference here means the two expected payoffs are equal, so Player 2 has no strict preference between the pure strategies and is willing to mix.
Mathematically, the board has already imposed , simplified it to , and solved for . Substituting back gives the same payoff from Up and from Down, which verifies the indifference condition.
The clip closes by stating the general lesson: in this example, a mixed strategy Nash equilibrium is found by writing the opponent's expected payoffs, setting them equal, and solving for the mixing probability. The displayed equilibrium pair is for Player 2 and for Player 1.
A mixed strategy involves a player randomizing over their pure strategies according to a specific probability distribution. In the presented 2x2 game, Player 1 assigns probability to Up and to Down, while Player 2 assigns probability to Up and to Down. These probabilities must sum to 1 for each player.
To find a mixed strategy Nash equilibrium, the probabilities chosen by one player must make the opposing player indifferent between all pure strategies they are randomizing over. This means the expected payoff of playing strategy A must equal the expected payoff of playing strategy B.
The expected payoff for Player 1 playing Up is found by weighting each possible outcome's payoff by the probability of Player 2 choosing that corresponding action. The calculation is , which simplifies algebraically to .
Similarly, the expected payoff for Player 1 playing Down weights the payoffs of 1 and 4 by Player 2's probabilities and . The expression is , which expands and simplifies to .
Once the expected payoff functions for both of Player 1's pure strategies are derived in terms of Player 2's probability , the next step to find the mixed strategy Nash equilibrium is to set these two expressions equal to each other () and solve for .
The video uses a 2x2 payoff matrix in which Player 1 randomizes between Up and Down with probabilities p and 1-p, and Player 2 randomizes between Up and Down with probabilities q and 1-q. These probabilities are the unknowns in the mixed-strategy calculation.
A player's expected payoff from a pure strategy is the sum of that player's payoffs in the relevant cells, each weighted by the probability that the opponent chooses the corresponding pure strategy. In the clip, Player 1's payoffs are weighted by q and 1-q, while Player 2's payoffs are weighted by p and 1-p.
To find the opponent's mixing probability that supports randomization, set the player's two pure-strategy expected payoffs equal. Equality means the player is indifferent between the two actions, so both can be used with positive probability in equilibrium.
Player 1's expected payoffs are (UP)= and (DOWN)=4-3q. Setting them equal gives , hence and . This is the probability that makes Player 1 indifferent between Up and Down.
Using the matrix entries -3 and 1 in the Up column for Player 2, the expected payoff from Up is -3p+. Simplifying yields 1-4p.
Using the matrix entries 2 and -1 in the Down column for Player 2, the expected payoff from Down is . Simplifying yields 3p-1.
Set Player 2's two expected payoffs equal: . Rearranging gives , so . This is the probability that makes Player 2 indifferent between Up and Down.
Player 1's indifference equation determines q, not p, because Player 1's payoffs depend on Player 2's mixture. Likewise, Player 2's indifference equation determines p, not q. Confusing these roles is a frequent mistake in mixed-strategy calculations.
This clip shows the final step of a worked example. A mixed strategy Nash equilibrium is represented by the pair of randomization probabilities displayed on the board: Player 2 uses for Up, and Player 1 uses for Up. The narration treats these values as the equilibrium mixing probabilities for the game.
The speaker explains that is the probability that makes Player 2 indifferent between Up and Down. Indifference means Player 2's expected payoff from Up equals Player 2's expected payoff from Down, so either pure strategy yields the same payoff and mixing is acceptable.
The board writes Player 2's expected payoffs as functions of Player 1's mixing probability: and . These expressions come directly from the payoff matrix columns and are the basis for the indifference equation.
To find the probability that makes Player 2 indifferent, the board sets the two expected payoffs equal: . Rearranging gives , hence . This is the value the speaker highlights in the narration.
Substituting into the displayed payoff formulas gives and . Since the two payoffs match, the board's solution indeed makes Player 2 indifferent, confirming the role of in the mixed equilibrium.
Explore conditions, steps and evidence. Supplementary explanations are labeled separately from content shown in the video.
The payoff matrix shows (p) next to Player 1's Up strategy and (1-p) next to Player 1's Down strategy.
The speaker states that Player 1 chooses Up with probability p and Down with probability 1-p.
p
Probability that Player 1 chooses the Up strategy.
[0, 1]
The payoff matrix shows (q) next to Player 2's Up strategy and (1-q) next to Player 2's Down strategy.
The speaker states that Player 2 chooses Up with probability q and Down with probability 1-q.
q
Probability that Player 2 chooses the Up strategy.
[0, 1]
The expression (UP) = is written on the screen.
The speaker explains this as the expected payoff for Player 1 of playing Up.
(UP)
Expected payoff for Player 1 when choosing the Up strategy.
Real numbers
The expression (DOWN) = is written on the screen.
The speaker explains this as the expected payoff for Player 1 of playing Down.
(DOWN)
Expected payoff for Player 1 when choosing the Down strategy.
Real numbers
Left side of the payoff matrix is labeled PLAYER 1 with row strategies Up and Down.
PLAYER 1
The first player in the two-player game; chooses between Up and Down.
Game-theory agent
Top of the payoff matrix is labeled PLAYER 2 with column strategies Up and Down.
PLAYER 2
The second player in the two-player game; chooses between Up and Down.
Game-theory agent
The row labeled Up is marked (p), and the row labeled Down is marked (1-p).
Later the speaker says this is the value for p that makes Player 2 indifferent between Up and Down.
p
Probability that Player 1 plays Up in the mixed strategy.
The lower row label is (1-p) next to Down.
The speaker uses 1-p as the probability weight when computing Player 2's expected payoffs.
1-p
Probability that Player 1 plays Down.
The column labeled Up is marked (q), and the column labeled Down is marked (1-q).
The speaker solves and obtains .
q
Probability that Player 2 plays Up in the mixed strategy.
The right column label is (1-q) next to Down.
The speaker uses 1-q as the probability weight when computing Player 1's expected payoffs.
1-q
Probability that Player 2 plays Down.
Top-left cell of the matrix shows 2,-3.
(2,-3)
Payoff pair when Player 1 plays Up and Player 2 plays Up; first number is Player 1's payoff, second is Player 2's payoff.
Payoff entries in the matrix
Top-right cell of the matrix shows 1,2.
(1,2)
Payoff pair when Player 1 plays Up and Player 2 plays Down.
Payoff entries in the matrix
The speaker introduces the concept of a mixed strategy where players choose actions with specific probabilities.
The payoff matrix displays probabilities p, 1-p, q, and 1-q alongside the strategies Up and Down for both players.
A mixed strategy is a probability distribution over a player's available pure strategies. In this game, Player 1 plays Up with probability p and Down with probability 1-p, while Player 2 plays Up with probability q and Down with probability 1-q.
Probabilities must sum to 1 for each player.
Each probability must be between 0 and 1.
The speaker calculates the expected payoff by multiplying each possible payoff by its corresponding probability and summing the results.
The step-by-step calculation of (UP) and (DOWN) is shown on the screen.
To find the expected payoff of a specific pure strategy against an opponent's mixed strategy, multiply each possible outcome's payoff by the probability of the opponent choosing that corresponding action, then sum these products.
Requires knowing the payoffs for all outcomes and the probabilities of the opponent's strategies.
The matrix labels rows with (p) and (1-p) and columns with (q) and (1-q).
The speaker refers to these as probabilities while setting up expected payoffs.
In this worked example, each player randomizes over two pure strategies. Player 1 plays Up with probability p and Down with probability 1-p. Player 2 plays Up with probability q and Down with probability 1-q. These probabilities are used as weights in expected-payoff calculations.
Two-player game
Each player has two pure strategies
Probabilities on each player's strategy set sum to 1
For Player 1: (UP)= and (DOWN)=.
For Player 2: (UP)=-3p+1-p and (DOWN)=.
A player's expected payoff from a pure strategy is computed by multiplying each possible outcome payoff by the probability of the opponent choosing the corresponding pure strategy, then adding those terms. In the video, Player 1's payoffs are weighted by Player 2's probabilities q and 1-q, while Player 2's payoffs are weighted by Player 1's probabilities p and 1-p.
Opponent's strategy distribution is known or being solved for
Payoffs are read from the corresponding cells of the game matrix
The speaker says to take the two expected payoffs and set them equal to each other, then solve for the mixing probability.
The board shows and later .
To find the mixing probability that makes a player willing to randomize, set that player's expected payoff from each pure strategy equal. The resulting equation identifies the opponent's probability that leaves the player indifferent between the two actions.
The player under consideration must be indifferent between the two pure strategies in support
Both pure strategies are assigned positive probability in the mixed equilibrium
The speaker says, "So that is how you can find a mixed strategy Nash equilibrium."
The board displays the solved probabilities and in red boxes.
In this clip, a mixed strategy Nash equilibrium is presented as the pair of randomization probabilities for the two players that makes each player willing to mix between their pure strategies. The worked example ends with for Player 2 and for Player 1.
Two-player strategic game
Each player may randomize over pure strategies
Equilibrium probabilities are found by making the opponent indifferent among the strategies being mixed over
The speaker explains that is the value that makes Player 2 "indifferent to choosing up or down" because "either way I will get the same expected payoff."
The board sets and solves it to obtain .
To find the probability with which the opponent should mix, set the mixing player's expected payoffs from the relevant pure strategies equal. In the example, Player 2's expected payoff from Up equals Player 2's expected payoff from Down when .
The player whose indifference is imposed must be mixing between the listed pure strategies
Expected payoffs are computed using the opponent's mixing probabilities
The board shows , then , then .
Once the two expected-payoff expressions are written, equate them and solve the resulting linear equation for the opponent's mixing probability. Here the equality simplifies to , hence .
The payoff expressions are linear in the unknown mixing probability
The speaker states that to find the mixed strategy Nash equilibrium, we need to find the values of p and q that make both players indifferent about their own strategy.
In a mixed strategy Nash equilibrium, the probabilities chosen by a player must make the opposing player indifferent between all pure strategies that are played with positive probability.
The game has a mixed strategy Nash equilibrium where both players randomize between their two strategies.
For all players in a mixed strategy Nash equilibrium.
The board derives , then , then .
The speaker states that when , Player 1 is indifferent between playing Up or Down.
For this game, Player 1's expected payoffs from Up and Down are equal exactly when .
Player 2 mixes Up with probability q and Down with probability 1-q
Player 1's payoffs are taken from the displayed matrix
For the given 2x2 payoff matrix.
The board derives , then , then .
The speaker says this is the value for p that makes Player 2 indifferent between Up and Down.
For this game, Player 2's expected payoffs from Up and Down are equal exactly when .
Player 1 mixes Up with probability p and Down with probability 1-p
Player 2's payoffs are taken from the displayed matrix
For the given 2x2 payoff matrix.
The speaker states that is the probability value that makes Player 2 indifferent between Up and Down.
The board shows (Up)=1-4p, (Down)=3p-1, and the solution .
When Player 1 chooses Up with probability , Player 2's expected payoff from Up equals Player 2's expected payoff from Down.
Use the payoff matrix shown on the board
Compute Player 2's expected payoff against Player 1's mixed strategy (p, 1-p)
For the specific game displayed on the board, at the equality (Up)=(Down) holds.
The speaker verbally walks through the calculation of the expected payoff for Player 1 playing Up.
The mathematical steps are written sequentially on the screen.
Multiply the payoff of 2 (when Player 2 plays Up) by the probability q, and add the payoff of 1 (when Player 2 plays Down) multiplied by the probability 1-q.
Definition of expected value.
Distribute the 1 into the parentheses.
Algebraic simplification.
Combine like terms ().
Algebraic simplification.
The expected payoff for Player 1 when playing Up is .
The speaker verbally walks through the calculation of the expected payoff for Player 1 playing Down.
The mathematical steps are written sequentially on the screen.
Multiply the payoff of 1 (when Player 2 plays Up) by the probability q, and add the payoff of 4 (when Player 2 plays Down) multiplied by the probability 1-q.
Definition of expected value.
Distribute the 4 into the parentheses.
Algebraic simplification.
Combine like terms ().
Algebraic simplification.
The expected payoff for Player 1 when playing Down is 4 - 3q.
The board shows , then , then .
The speaker narrates adding 3q to both sides, subtracting 1, and dividing by 4.
Set Player 1's expected payoff from Up equal to Player 1's expected payoff from Down.
Indifference condition for a mixed strategy.
Move the q-terms to one side and constants to the other: add 3q to both sides and subtract 1 from both sides.
Algebraic rearrangement of an equality.
Divide both sides by 4.
Solving a linear equation for q.
The mixing probability for Player 2 that makes Player 1 indifferent is .
The board writes (UP)=-3p+.
The speaker explains the -3 payoff occurs with probability p and the 1 payoff occurs with probability 1-p.
Weight Player 2's payoff -3 by probability p and payoff 1 by probability 1-p.
Definition of expected payoff using the opponent's mixed strategy.
Distribute the 1 across (1-p).
Algebraic simplification.
Combine like terms in p.
Collecting coefficients.
Player 2's expected payoff from Up is 1-4p.
The board writes (DOWN)=.
The speaker says the payoff 2 occurs with probability p and the payoff -1 occurs with probability 1-p.
Weight Player 2's payoff 2 by probability p and payoff -1 by probability 1-p.
Definition of expected payoff using the opponent's mixed strategy.
Expand (-1)(1-p) to p-1.
Distributive law.
Combine like terms in p.
Collecting coefficients.
Player 2's expected payoff from Down is 3p-1.
The board shows , then , then .
The speaker narrates adding 4p to one side, adding 1 to the other, and dividing by 7.
Set Player 2's expected payoff from Up equal to Player 2's expected payoff from Down.
Indifference condition for a mixed strategy.
Move the p-terms to one side and constants to the other: add 4p to both sides and add 1 to both sides.
Algebraic rearrangement of an equality.
Divide both sides by 7.
Solving a linear equation for p.
The mixing probability for Player 1 that makes Player 2 indifferent is .
The board lists the payoff matrix and the two expressions (Up) = -3p + and (Down) = .
The speaker refers to these as expected payoffs for Player 2's choices.
The clip does not separately restate each multiplication step aloud; the formulas are visible on the board.
Player 2's payoff from Up is weighted by Player 1's probabilities of Up and Down.
Expected payoff is the probability-weighted sum of the payoffs in the corresponding column.
Combine the terms involving p.
Algebraic simplification: -3p - .
Player 2's payoff from Down is weighted by Player 1's probabilities of Up and Down.
Expected payoff is the probability-weighted sum of the payoffs in the corresponding column.
Combine the terms involving p.
Algebraic simplification: .
The board obtains (Up)=1-4p and (Down)=3p-1 as Player 2's expected payoffs against Player 1's mixed strategy.
The board shows , then , then .
The speaker identifies as the probability that makes Player 2 indifferent.
Set Player 2's expected payoff from Up equal to Player 2's expected payoff from Down.
Indifference condition for a player who is mixing between those pure strategies.
Move the constant terms to one side and the p-terms to the other.
Add 4p to both sides and add 1 to both sides.
Solve for p.
Divide both sides by 7.
The unique solution shown on the board is .
A 2x2 payoff matrix is drawn showing the payoffs for Player 1 and Player 2 for all combinations of Up and Down strategies.
Analyze the given 2x2 game to find the mixed strategy Nash equilibrium.
Player 1 strategies: Up, Down
Player 2 strategies: Up, Down
Payoffs: (Up, Up) -> (2, -3), (Up, Down) -> (1, 2), (Down, Up) -> (1, 1), (Down, Down) -> (4, -1)
Calculate the expected payoffs for Player 1's pure strategies based on Player 2's mixed strategy probability q.
Calculate the expected payoff for Player 1 choosing Up.
Expected value formula applied to Player 1's payoffs in the Up row.
Calculate the expected payoff for Player 1 choosing Down.
Expected value formula applied to Player 1's payoffs in the Down row.
The expected payoffs for Player 1 are for Up and 4 - 3q for Down.
The algebraic simplifications are shown step-by-step on the screen and match standard expected value calculations.
A 2x2 payoff matrix is shown with PLAYER 1 rows Up/Down and PLAYER 2 columns Up/Down.
The board computes (UP)=, (DOWN)=4-3q, (UP)=1-4p, (DOWN)=3p-1.
The speaker solves and and interprets them as indifference probabilities.
Given the displayed 2x2 game matrix, find the mixing probabilities p and q that make each player indifferent between Up and Down.
Player 1 strategies: Up with probability p, Down with probability 1-p
Player 2 strategies: Up with probability q, Down with probability 1-q
Matrix payoffs: (Up,Up)=(2,-3), (Up,Down)=(1,2), (Down,Up)=(1,1), (Down,Down)=(4,-1)
Compute q from Player 1's indifference condition and p from Player 2's indifference condition.
Compute Player 1's expected payoff from Up using Player 2's mixture.
Expected payoff definition.
Compute Player 1's expected payoff from Down using Player 2's mixture.
Expected payoff definition.
Set Player 1's two expected payoffs equal.
Indifference condition.
Solve the linear equation for q.
Algebra.
Compute Player 2's expected payoff from Up using Player 1's mixture.
Expected payoff definition.
Compute Player 2's expected payoff from Down using Player 1's mixture.
Expected payoff definition.
Set Player 2's two expected payoffs equal.
Indifference condition.
Solve the linear equation for p.
Algebra.
and .
Substitute back: for , (UP)= and (DOWN)=; for , (UP)=? actually and (DOWN)=, so the equalities hold.
The board shows a 2x2 payoff matrix with Player 1 rows (p) Up and (1-p) Down, Player 2 columns (q) Up and (1-q) Down, and entries (2,-3), (1,2), (1,1), (4,-1).
The solved values and are boxed in red.
The speaker concludes, "So that is how you can find a mixed strategy Nash equilibrium."
The derivation of is already completed on the board before this clip begins, so the intermediate steps for q are not spoken in this excerpt.
Find the mixed strategy Nash equilibrium probabilities for the displayed two-player game.
Payoff matrix entries: (Up, Up)=(2,-3), (Up, Down)=(1,2), (Down, Up)=(1,1), (Down, Down)=(4,-1)
Player 1 mixes Up with probability p and Down with probability 1-p
Player 2 mixes Up with probability q and Down with probability 1-q
Determine the equilibrium mixing probabilities p and q.
The board already displays Player 2's equilibrium mixing probability.
Previously computed result shown on the board.
Write Player 2's expected payoff from Up against Player 1's mixture.
Expected payoff calculation from the first column of the matrix.
Write Player 2's expected payoff from Down against Player 1's mixture.
Expected payoff calculation from the second column of the matrix.
Impose Player 2's indifference between Up and Down.
A mixing player must receive equal expected payoff from the strategies being mixed over.
Solve the linear equation for Player 1's mixing probability.
Algebraic rearrangement gives , hence .
The mixed strategy Nash equilibrium shown is for Player 2 and for Player 1.
Substitute into the displayed payoff formulas: (Up)= and (Down)=, so Player 2 is indeed indifferent.
White circles and underlines appear around specific text and numbers in the payoff matrix and equations as the speaker discusses them.
Payoff matrix cells
Probability labels
Equation terms
Circles appear around 'PLAYER 1', 'PLAYER 2', 'Up', 'Down', '(p)', '(1-p)', '(q)', '(1-q)'
Circles appear around specific payoff numbers (2, 1, 4) as they are used in the expected payoff calculations
The overall structure of the 2x2 payoff matrix remains constant throughout the clip.
The visual highlighting serves to direct the viewer's attention to the specific components of the game and the mathematical terms being actively discussed or calculated by the speaker.
The screen is a black digital whiteboard with a 2x2 payoff matrix on the left and handwritten equations on the right.
2x2 payoff matrix
PLAYER 1 row labels
PLAYER 2 column labels
handwritten expected-payoff equations
boxed final values and
First the right side contains Player 1 payoff formulas and the solution for q.
Around 50 seconds the earlier Player 1 work is cleared and the final is boxed at the top.
Then Player 2 payoff formulas are written below and the solution for is boxed.
The payoff matrix itself remains visible throughout.
The strategy labels Up and Down remain fixed for both players.
The visual organization separates the two subproblems: first solve for the opponent mixture that makes Player 1 indifferent, then solve for the opponent mixture that makes Player 2 indifferent.
While deriving Player 2's payoffs, individual matrix entries are circled as they are referenced.
Matrix entry -3 in (Up,Up)
Matrix entry 1 in (Down,Up)
Matrix entry 2 in (Up,Down)
Matrix entry -1 in (Down,Down)
Row probabilities p and 1-p
The -3 entry is circled when forming the first term of (UP).
The 1 entry in the lower-left cell is circled when adding the second term of (UP).
The 2 entry in the upper-right cell is circled when starting (DOWN).
The -1 entry in the lower-right cell is circled when completing (DOWN).
The matrix structure and payoff ordering remain unchanged.
The circling visually links each algebraic term to the exact payoff cell being used in the expected-value calculation.
A blackboard-style layout remains on screen throughout the clip, with the payoff matrix on the left and algebra on the right.
The red boxes around and stay visible for the full clip.
2x2 payoff matrix
Row labels (p) Up and (1-p) Down for Player 1
Column labels (q) Up and (1-q) Down for Player 2
Red-boxed results and
Expected-payoff equations for Player 2
Linear equation and its solution
No new writing appears during the clip.
The audio explanation shifts attention to the meaning of while the board content stays fixed.
The payoff matrix entries remain unchanged.
The displayed equilibrium probabilities and remain highlighted.
The algebraic derivation for Player 2's indifference remains visible.
The visual presentation functions as a completed worked example: the matrix supplies the game data, the right-hand algebra derives Player 2's indifference condition, and the red boxes summarize the equilibrium mixing probabilities.
The speaker explicitly says Player 1 would not care whether to play Up or Down because the expected payoff is the same either way.
One might think that setting two expected payoffs equal means the common payoff is zero or that the player has no meaningful preference structure.
In this example the equality only says the two pure strategies yield the same expected payoff. The common value can be nonzero; here it is for Player 1 when .
Player 1's indifference equation is solved for q, and Player 2's indifference equation is solved for p.
The speaker describes finding the value of q that makes Player 1 indifferent and the value of p that makes Player 2 indifferent.
A learner may incorrectly think Player 1's indifference condition determines Player 1's own probability p.
In the standard method shown here, Player 1's expected payoffs depend on Player 2's mixture q, so solving Player 1's indifference gives q. Likewise, Player 2's expected payoffs depend on p, so solving Player 2's indifference gives p.
The speaker emphasizes that is the value that makes Player 2 indifferent because either choice gives the same expected payoff.
One might think any probability for the opponent could support mixing.
In this example, only equalizes Player 2's expected payoffs from Up and Down, so that is the probability used in the mixed equilibrium.
The speaker uses the probabilities defined in the mixed strategy to calculate the expected payoffs.
The concept of a mixed strategy (assigning probabilities to pure strategies) is directly applied to calculate the expected payoff of each pure strategy.
The speaker states the goal is to find probabilities that make players indifferent, and then proceeds to calculate the expected payoffs which will be set equal to find that indifference.
Calculating the expected payoffs for each pure strategy is a necessary prerequisite step to applying the indifference principle to find the mixed strategy Nash equilibrium.
The probabilities p,1-p,q,1-q appear directly as weights in the expected-payoff expressions.
The mixed-strategy probabilities are needed before expected payoffs can be written as weighted sums.
After writing (UP), (DOWN), (UP), and (DOWN), the board sets pairs equal to solve for q and p.
The indifference method is applied only after the expected payoff functions have been computed.
The equation is produced from the indifference condition and solved to .
The claim about q follows directly from applying the indifference condition to Player 1's two expected payoffs.
The equation is produced from the indifference condition and solved to .
The claim about p follows directly from applying the indifference condition to Player 2's two expected payoffs.
The whole clip is a single worked application of the mixed-strategy procedure to the displayed matrix.
The worked example demonstrates how the indifference method is used in a concrete 2x2 game.
The speaker links the indifference calculation directly to finding a mixed strategy Nash equilibrium.
The board shows the indifference equation and the final equilibrium probabilities.
The indifference method is applied to compute the mixing probability needed for the mixed strategy Nash equilibrium.
The board first states (Up)=(Down) and then solves to get .
The solving step depends on first imposing the indifference condition between the two expected payoffs.
The speaker explicitly demonstrates how to calculate the expected payoff for a given strategy.
The speaker explains that finding the mixed strategy Nash equilibrium requires making players indifferent.
The board solves and boxes .
The speaker says to take the two expected payoffs and set them equal to each other.
The board writes (UP)=-3p+1-p and (DOWN)=.
Player 1's equality is solved for q, while Player 2's equality is solved for p.
The final boxed results are and .
The speaker explicitly asks what the value means and answers that it makes Player 2 indifferent.
The closing line says, "So that is how you can find a mixed strategy Nash equilibrium."
The speaker says Player 2 is indifferent because either way the expected payoff is the same.
Covered · Introduction to the game, players, strategies, and the definition of mixed strategies with probabilities p and q.
Covered · Explanation of the core principle for finding a mixed strategy Nash equilibrium: making players indifferent.
Covered · Step-by-step derivation of the expected payoff for Player 1 choosing the Up strategy.
Covered · Step-by-step derivation of the expected payoff for Player 1 choosing the Down strategy.
Covered · Restatement of the goal to find the value of q that makes Player 1 indifferent, setting up the next step of equating the expected payoffs.
Covered · Player 1's expected payoffs are compared, q is solved as , and the result is interpreted as making Player 1 indifferent.
Covered · The board is cleared to make space for the next part of the calculation while the boxed remains at the top.
Covered · Player 2's expected payoffs from Up and Down are derived from the matrix entries and simplified to 1-4p and 3p-1.
Covered · The two Player 2 expected payoffs are set equal, p is solved as , and the result is boxed.
Covered · The entire 15-second clip consists of a static worked-example board plus narration explaining that makes Player 2 indifferent and thereby completes the mixed strategy Nash equilibrium calculation.
Reviewed subject paths
Continue with related videos in the same subject.
YouTube10:40
YouTube8:20
YouTube6:05