Determination of the optimal pure strategies subset as the latent predominance set in some matrix games

Abstract

There has been defined the latent predominance set of a player in the matrix games with the nonempty set of the saddle points in pure strategies. Suggested the operations for aggregating the payoffs of a player, applying the optimal pure strategies, when the other player digresses from the optimality principle. Also displayed how and what aggregated advantage a player takes, applying a strategy from the latent predominance set.