Linear Programming and Game Theory 2 (AQA A-Level Further Maths): Flashcards

One player's gain equals other's loss; total payoff sums to zero

Outcomes from row player's (player A's) perspective

Maximum of row minima

Minimum of column maxima

Max of row minima = min of column maxima

$E(x) = \sum_{i=1}^{n} x_ip_i$ where $\sum p_i = 1$

Add constant to all entries to make non-negative

Subtract the constant added initially

Row/column with all better entries can eliminate another

Maximise $P = v$ where $v$ is value of game