= Matrix-game optimization problem
For a finite two-player <zero-sum game> with <payoff matrix> $A$ to the row player, its mixed-strategy optimization problem is
$$
\max_{p,v}v\quad\text{subject to}\quad A^Tp\geq v\mathbf1,\quad\mathbf1^Tp=1,\quad p\geq0.
$$
Every column inequality says that the <expected payoff> against that pure column is at least $v$. A randomized column gives an average of these payoffs, so the same guarantee holds against every mixed opposing strategy. The constraints on $p$ make it a <probability vector>. The corresponding minimizing linear-program dual gives the column player's security problem and the finite minimax value.
Back to article page