Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies
This article attempts to present an algorithm to find Nash equilibrium point in large two-person static games. In static games, each player chooses his/her strategy simultaneously with other players. Equilibrium can be easily recognized in static games with a limited number of strategies. This paper focuses on two-person games in which each player deals with many strategies. After reviewing the literature, this article considers concepts such as game, equilibrium, and rationalism in order to identify the problem and the required methodology to solve it; eventually, a heuristic-meta heuristic algorithm will be presented to solve such problems which have been validated using a sample problem.