For a finite two-player zero-sum game with payoff matrix to the row player, its mixed-strategy optimization problem isEvery 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.
Articles by others on the same topic
There are currently no matching articles.