A matrix game is a finite two-player zero-sum game whose entry is the row player's payoff when the players choose row and column .
When every entry of a payoff matrix is positive, its game value is positive. Setting converts the row player's probability vector and guaranteed value into the displayed linear program, whose optimum is . Conversely normalizing a feasible gives a mixed strategy guaranteeing . The dual maximizes under , and recovers the column strategy by normalization. Adding a constant to every payoff preserves Nash equilibria and lets this positive-payoff formulation handle general finite zero-sum games.
A payoff matrix records the row player's gains when row meets column . In a zero-sum game the other player's payoff is the negative. For mixed strategies , the expected row payoff is .
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.
If the column player has an optimal strategy at value and a row probability vector satisfies , then is optimal: it guarantees , while the optimal column strategy prevents every row strategy from exceeding .
If a symmetric invertible payoff matrix satisfies , both players may use
and the game value is .
For
both players optimally choose cards with probabilities , and the row player's expected payoff is .

Articles by others on the same topic (0)

There are currently no matching articles.