A new evolutionary approach for computing Nash equilibria in bimatrix games with known support

Abstract: In this paper, we present the application of the Differential Evolution (DE) algorithm to the problem of finding approximate Nash equilibria in matrix, non-zero sum games for two players with finite number of strategies. Nash equilibrium is one of the main concepts in game theory. It may be classified as continuous problem, where two probability distributions over the set of strategies of both players should be found. Every deviation from the global optimum is interpreted as Nash approximation and called ε-Nash equilibrium. The main advantage of the proposed algorithm is self-adaptive mutation operator, which direct the search process. The approach used in this article is based on the probability of chosing single pure strategy. In optimal mixed strategy, every strategy has some probability of being chosen. Our goal is to determine this probability and maximize payoff for a single player.

Object Details

• Location: Deutsche Nationalbibliothek Frankfurt am Main
• Extent: Online-Ressource
• Language: Englisch

References and Relationships

• Bibliographic citation: A new evolutionary approach for computing Nash equilibria in bimatrix games with known support ; volume:2 ; number:2 ; year:2012 ; pages:128-142 ; extent:15 ; Open computer science ; 2, Heft 2 (2012), 128-142 (gesamt 15)

Contributors, Places and Time

• Creator: Boryczka, Urszula ; Juszczuk, Przemyslaw

Further information

• DOI: 10.2478/s13537-012-0008-6
• URN: urn:nbn:de:101:1-2410301509046.264623953043
• Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
• Last update: 15.08.2025, 7:27 AM CEST