Mixing strategies in the matrix game

Abstract

The article considers the sequential strategies mixing in the matrix game as an algorithm for finding the optimal player’s strategy. Strategies are mixed in such a way as to obtain a row of the payment matrix with constant elements. As a result, such a row is deleted as dominated, or determines the value of a game. The games with two moves of the second player, which are solved without the use of the simplex method, are analyzed at each stage.