Pay-off matrices and play-safe strategies

Pay-off matrices and play-safe strategies

Spec DF1–DF3 · AQA A-Level Further Maths: Revision notes

Studying this course? Keep your progress in one place.

Key facts

  • In a zero-sum game one player's gain is exactly the other's loss; entries of the pay-off matrix are pay-offs to the row player.
  • Rowan's play-safe strategy is the row with the largest row minimum: the maximin.
  • Colin's play-safe strategy is the column with the smallest column maximum: the minimax.
  • A stable solution exists exactly when maximin == minimax, and that common number is the value of the game.
  • Always maximin ≤\le minimax; if they differ, there is no stable solution.

Zero-sum games and pay-off matrices

Rows are Rowan's strategies, columns are Colin's, and each entry is the pay-off to Rowan.

In a zero-sum game two players each choose a strategy at the same time, and one player's gain is exactly the other's loss. The game is shown as a pay-off matrix.

Rows are the strategies of the row player (Rowan), columns those of the column player (Colin). A negative entry means Rowan loses, which is a gain for Colin.

To construct a matrix from a description, work out the pay-off for every combination using the stated rule. To interpret an entry, say who gains, by how much, and in what units.

  1. 1

    Rowan picks a row

    Colin picks a column at the same time

  2. 2

    Read the entry

    where they meet: the pay-off to Rowan

  3. 3

    Zero-sum

    Colin's pay-off is the negative of the entry

Reading a pay-off matrix.
  • Each entrypay-off to the row player
  • Colin's pay-off matrixnegative of the transpose of Rowan's

Worked example

The pay-off is in pounds. The entry in row 2, column 3 is −5-5. Interpret it.

In Rowan's pay-off matrix the entry in row 1, column 2 is −4-4. Who gains?

Play-safe strategies

Each player guards against the worst: Rowan takes the best of the row minima, Colin the best of the column maxima.

A play-safe strategy guards against the worst outcome, assuming the opponent plays to hurt you.

  • Rowan finds the minimum of each row, then chooses the row with the largest of these: the maximin.
  • Colin finds the maximum of each column, then chooses the column with the smallest of these: the minimax.

Every game has play-safe strategies, but they only give a stable outcome in some games.

  1. 1

    Rowan: row minima

    the worst outcome for each row

  2. 2

    Rowan plays the maximin

    the row with the largest minimum

  3. 3

    Colin: column maxima

    the worst outcome for each column

  4. 4

    Colin plays the minimax

    the column with the smallest maximum

Finding the play-safe strategies.
  • Rowan (maximiser)maximin: largest of the row minima
  • Colin (minimiser)minimax: smallest of the column maxima

Worked example

Find both play-safe strategies for (3−12104−251)\begin{pmatrix} 3 & -1 & 2 \\ 1 & 0 & 4 \\ -2 & 5 & 1 \end{pmatrix}.

For (253416032)\begin{pmatrix} 2 & 5 & 3 \\ 4 & 1 & 6 \\ 0 & 3 & 2 \end{pmatrix}, what is Rowan's maximin?

Stable solutions and game value

A game is stable when maximin equals minimax; the common value is the value of the game.

A stable solution (a saddle point) exists when maximin == minimax.

  • The entry at that row and column is the value of the game, and both players use their play-safe strategies.
  • It is the smallest in its row, so if Rowan stays in that row Colin has no better column.
  • It is the largest in its column, so if Colin stays in that column Rowan has no better row.

If maximin ≠\ne minimax there is no stable solution: always maximin ≤\le minimax, and the value lies between them. Optimal play then needs mixed strategies.

−1−0.500.511.522.533.54maximin 0minimax 3

A game has maximin =1=1 and minimax =3=3. Is there a stable solution?

Proving a stable solution exists

Show the row minima, the column maxima, compare maximin and minimax, and name the strategies.

Show the working in order. Write the row minima and state the maximin and its row. Write the column maxima and state the minimax and its column.

Then compare. Equal means a stable solution exists, at that row and column, with value equal to the common number. Different means none exists.

If a question gives Colin's matrix instead, negate and transpose it first.

  1. 1

    Row minima

    State the maximin and its row

  2. 2

    Column maxima

    State the minimax and its column

  3. 3

    Compare

    Equal means stable

  4. 4

    Conclude

    Name the strategies and the value

Proving stability

Worked example

Does (425316102)\begin{pmatrix} 4 & 2 & 5 \\ 3 & 1 & 6 \\ 1 & 0 & 2 \end{pmatrix} have a stable solution?

Does (1432)\begin{pmatrix} 1 & 4 \\ 3 & 2 \end{pmatrix} have a stable solution?

Try an exam question

The pay-off matrix to Rowan in a zero-sum game is (3546)\begin{pmatrix} 3 & 5 \\ 4 & 6 \end{pmatrix}. Show that the game has a stable solution and state the value of the game.

[4 marks]

That's the notes covered.

Carry on to the next subtopic.

Try a question

Which is Rowan's play-safe strategy?

1 mark, marked against the mark scheme

Revision notes