Paper 1, Section I, H

Optimization | Part IB, 2016

A=(525232362486)A=\left(\begin{array}{rrr} 5 & -2 & -5 \\ -2 & 3 & 2 \\ -3 & 6 & 2 \\ 4 & -8 & -6 \end{array}\right)

be the payoff of a two-person zero-sum game, where player I (randomly) picks a row to maximise the expected payoff and player II picks a column to minimise the expected payoff. Find each player's optimal strategy and the value of the game.

Typos? Please submit corrections to this page on GitHub.