Journal of Global Optimization
A Game-Theoretic Approach for Binding in Behavioral Synthesis
VLSID '03 Proceedings of the 16th International Conference on VLSI Design
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Settling the Complexity of Two-Player Nash Equilibrium
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Computing Nash Equilibria: Approximation and Smoothed Complexity
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Polynomial algorithms for approximating Nash equilibria of bimatrix games
Theoretical Computer Science
A note on approximate Nash equilibria
Theoretical Computer Science
Mixed-integer programming methods for finding Nash equilibria
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Computing Nash equilibria through computational intelligence methods
Journal of Computational and Applied Mathematics - Special issue: Selected papers of the international conference on computational methods in sciences and engineering (ICCMSE-2003)
An optimization approach for approximate Nash equilibria
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Using game theory to analyze wireless ad hoc networks
IEEE Communications Surveys & Tutorials
Differential evolution as a new method of computing nash equilibria
Transactions on Computational Collective Intelligence IX
| Hi-index | 0.00 |
Nash equilibrium is one of the main concepts in the game theory. Recently it was shown, that problem of finding Nash equilibrium and an approximate Nash equilibrium is PPAD-complete. In this article we adapt Differential Evolution algorithm (DE) to the above problem. It may be classified as continuous problem, where two probability distributions over the set of pure strategies of both players should be found. Every deviation from the global optimum is interpreted as Nash approximation and called ε-Nash equilibrium. We show, that the Differential Evolution approach can be determined as iterative method, which in successive iterations is capable to obtain ε value close to the global optimum. The contribution of this paper is the experimental analysis of the proposed approach and indication of it's strong features. We try to demonstrate, that the proposed method is very good alternative for the existing mathematical analysis of the mentioned Nash equilibrium problem.