Economic Theory

, Volume 42, Issue 1, pp 9–37

Enumeration of Nash equilibria for two-player games

Authors

  • David Avis
    • School of Computer Science and GERADMcGill University
  • Gabriel D. Rosenberg
    • Yale Law School
  • Rahul Savani
    • Department of Computer Science and DIMAPUniversity of Warwick
    • Department of MathematicsLondon School of Economics
Symposium

DOI: 10.1007/s00199-009-0449-x

Cite this article as:
Avis, D., Rosenberg, G.D., Savani, R. et al. Econ Theory (2010) 42: 9. doi:10.1007/s00199-009-0449-x

Abstract

This paper describes algorithms for finding all Nash equilibria of a two-player game in strategic form. We present two algorithms that extend earlier work. Our presentation is self-contained, and explains the two methods in a unified framework using faces of best-response polyhedra. The first method lrsnash is based on the known vertex enumeration program lrs, for “lexicographic reverse search”. It enumerates the vertices of only one best-response polytope, and the vertices of the complementary faces that correspond to these vertices (if they are not empty) in the other polytope. The second method is a modification of the known EEE algorithm, for “enumeration of extreme equilibria”. We also describe a second, as yet not implemented, variant that is space efficient. We discuss details of implementations of lrsnash and EEE, and report on computational experiments that compare the two algorithms, which show that both have their strengths and weaknesses.

Keywords

Bimatrix gameNash equilibriumLinear programmingComplementarity

JEL Classification

C72

Copyright information

© Springer-Verlag 2009