Open AccessMixing strategies in the matrix game
Author(s) -
Victor N. Assaul,
Vladimir K. Lashchenov
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1515/3/032011
Subject(s) - mixing (physics) , constant (computer programming) , matrix (chemical analysis) , strategy , mathematical optimization , simplex , computer science , mathematical economics , payment , repeated game , mathematics , game theory , combinatorics , physics , materials science , quantum mechanics , world wide web , composite material , programming language
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.