Abstract
A method is proposed for solving large-sized matrix games (zero-sum games) of special form for which there is a fast algorithm of searching for the best pure strategy of a player given any mixed strategy of the opponent. Examples of problems leading to such games are given. The method proposed is numerically compared with the Brown-Robinson iterative method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have