A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A new evolutionary approach for computing Nash equilibria in bimatrix games with known support
2012
Open Computer Science
AbstractIn 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
doi:10.2478/s13537-012-0008-6
fatcat:risatjeu2vgohcapojipqouypy