Approximating Nash Equilibrium Using Genetic Algorithm

Article Preview

Abstract:

The problem of detecting the Nash equilibrium of a non cooperative n-person game is solved by introducing a non-linear optimization model that enables evolutionary search operators to converge towards Nash Equilibrium of a game.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 734-737)

Pages:

3098-3101

Citation:

Online since:

August 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] S. Govindan and R. Wilson, A global Newton method to compute Nash equilibria, Journal of Economic Theory, vol. 110, p.65–86, (2003).

DOI: 10.1016/s0022-0531(03)00005-x

Google Scholar

[2] S. Govindan and R. Wilson, Computing Nash equilibria by iterated polymatrix approximation, Journal of Economic Dynamics and Control, vol. 28, p.1229–1241, (2004).

DOI: 10.1016/s0165-1889(03)00108-8

Google Scholar

[3] S. Govindan and R. Wilson, A decomposition algorithm for n-player games, Stanford University Graduate School of Business, no. 1967, August (2007).

Google Scholar

[4] Chatterjee B. An optimization formulation to compute Nash equilibrium in finite games[C]/Methods and Models in Computer Science, 2009. ICM2CS 2009. Proceeding of International Conference on. IEEE, 2009: 1-5.

DOI: 10.1109/icm2cs.2009.5397970

Google Scholar

[5] Whitley D. A genetic algorithm tutorial[J]. Statistics and computing, 1994, 4(2): 65-85.

Google Scholar