Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies

Mohammad Mahdi Mohtadi and Kazem Nogondarian

Applied Mathematics and Computation, 2015, vol. 251, issue C, 442-452

Abstract: 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.

Keywords: Game theory; Static Game; Big problems; Computing Nash equilibrium; Mixed strategy; Game solver algorithm (GSA) (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300314015628
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:251:y:2015:i:c:p:442-452

DOI: 10.1016/j.amc.2014.11.039

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().