Simple search methods for finding a Nash equilibrium

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 664-669

  Porter, Ryan ^a   Nudelman, Eugene ^a   Shoham, Yoav ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NASH EQUILIBRIUM (NE); SEARCH METHODS; SUBDIVISIONS; SUPPORT SIZE;

ALGORITHMS; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; RELAXATION PROCESSES; VARIATIONAL TECHNIQUES;

GAME THEORY;

EID: 9444249830     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Blum, B.; Shelton, C. R.; and Koller, D. 2003. A continuation method for Nash equilibria in structured games. In IJCAI-03.
2. Dechter, R. 2003. Constraint Processing. Morgan Kaufmann.
3. Dickhaut, J., and Kaplan, T. 1991. A program for finding Nash equilibria. The Mathematica Journal 87-93.
4. Govindan, S., and Wilson, R. 2003. A global newton method to compute Nash equilibria. In Journal of Economic Theory.
5. Lemke, C., and Howson, J. 1964. Equilibrium points of bimatrix games. Journal of the Society for Industrial and Applied Mathematics 12:413-423.
6. McKelvey, R., and McLennan, A. 1996. Computation of equilibria in finite games. In H. Amman, D. Kendrick, J. R., ed., Handbook of Computational Economics, volume I. Elsevier. 87-142.
7. McKelvey, R.; McLennan, A.; and Turocy, T. 2003. Gambit: Software tools for game theory, version 0.97.0.5. Available at http://econweb.tamu.edu/gambit/.
8. McLennan, A., and Berg, J. 2002. The asymptotic expected number of Nash equilibria of two player normal form games. Mimeo, University of Minnesota.
9. Nash, J. 1950. Equilibrium points in n-person games. Proceedings of the National Academy of Sciences of the United States of America 36:48-49.
10. Nudelman, E.; Wortman, J.; Shoham, Y.; and Leyton-Brown, K. 2004. Run the GAMUT: A comprehensive approach to evaluating game-theoretic algorithms. In AAMAS-04.
11. Papadimitriou, C. 2001. Algorithms, games, and the internet. In STOC-01, 749-753.
12. Rinott, Y., and Scarsini, M. 2000. On the number of pure strategy Nash equilibria in random games. Games and Economic Behavior 33:274-293.
13. van der Laan, G.; Talman, A.; and van der Heyden, L. 1987. Simplicial variable dimension algorithms for solving the nonlinear complementarity problem on a product of unit simplices using a general labelling. Mathematics of Operations Research.
14. von Stengel, B. 2002. Computing equilibria for two-person games. In Aumann, R., and Hart, S., eds., Handbook of Game Theory, volume 3. North-Holland, chapter 45, 1723-1759.