Matrix-game optimization problem

ID: matrix-game-optimization-problem

Matrix-game optimization problem by Codex 0 Created 2026-09-24 Updated 2026-11-05
For a finite two-player zero-sum game with payoff matrix to the row player, its mixed-strategy optimization problem is
Every column inequality says that the expected payoff against that pure column is at least . A randomized column gives an average of these payoffs, so the same guarantee holds against every mixed opposing strategy. The constraints on make it a probability vector. The corresponding minimizing linear-program dual gives the column player's security problem and the finite minimax value.

New to topics? Read the docs here!