Simple search methods for finding a Nash equilibrium

We present two simple search methods for computing a sample Nash equilibrium in a normal-form game: one for 2- player games and one for n-player games. We test these algorithms on many classes of games, and show that they perform well against the state of the art- the Lemke-Howson algorithm for 2-player games, and Simplicial Subdivision and Govindan-Wilson for n-player games.

[1]  Daphne Koller,et al.  Multi-Agent Influence Diagrams for Representing and Solving Games , 2001, IJCAI.

[2]  Daphne Koller,et al.  A Continuation Method for Nash Equilibria in Structured Games , 2003, IJCAI.

[3]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[4]  J. Mertens,et al.  ON THE STRATEGIC STABILITY OF EQUILIBRIA , 1986 .

[5]  B. Stengel,et al.  COMPUTING EQUILIBRIA FOR TWO-PERSON GAMES , 1996 .

[6]  Andrew McLennan,et al.  The Maximal Number of Regular Totally Mixed Nash Equilibria , 1997 .

[7]  Todd R. Kaplan,et al.  A Program for Finding Nash Equilibria , 1993 .

[8]  R. McKelvey,et al.  Computation of equilibria in finite games , 1996 .

[9]  Yoav Shoham,et al.  Run the GAMUT: a comprehensive approach to evaluating game-theoretic algorithms , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[10]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[11]  C. E. Lemke,et al.  Bimatrix Equilibrium Points and Mathematical Programming , 1965 .

[12]  H. Kuk.  On equilibrium points in bimatrix games , 1996 .

[13]  Vincent Conitzer,et al.  Complexity Results about Nash Equilibria , 2002, IJCAI.

[14]  Eitan Zemel,et al.  Nash and correlated equilibria: Some complexity considerations , 1989 .

[15]  Christos H. Papadimitriou,et al.  On Total Functions, Existence Theorems and Computational Complexity , 1991, Theor. Comput. Sci..

[16]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[17]  C. E. Lemke,et al.  Equilibrium Points of Bimatrix Games , 1964 .

[18]  O. Mangasarian.  Equilibrium Points of Bimatrix Games , 1964 .

[19]  David G. Mitchell,et al.  Finding hard instances of the satisfiability problem: A survey , 1996, Satisfiability Problem: Theory and Applications.

[20]  Andrew McLennan,et al.  Asymptotic expected number of Nash equilibria of two-player normal form games , 2005, Games Econ. Behav..

[21]  Andrew McLennan,et al.  Gambit: Software Tools for Game Theory , 2006 .

[22]  Marco Scarsini,et al.  On the Number of Pure Strategy Nash Equilibria in Random Games , 2000, Games Econ. Behav..

[23]  Christos H. Papadimitriou,et al.  Algorithms, Games, and the Internet , 2001, ICALP.

[24]  G. Dantzig,et al.  Programming of Interdependent Activities: I General Discussion , 1949 .

[25]  Barry O'Neill.  Handbook of Game Theory, Volume 3: Edited by Robert Aumann and Sergiu Hart, Elsevier, New York, 2002 , 2004, Games Econ. Behav..

[26]  Robert Wilson,et al.  A global Newton method to compute Nash equilibria , 2003, J. Econ. Theory.

[27]  A. Talman,et al.  Simplicial variable dimension algorithms for solving the nonlinear complementarity problem on a product of unit simplices using a general labelling , 1987 .