Local Search Methods for Finding a Nash Equilibrium in Two-Player Games

The computation of a Nash equilibrium of a game is a challenging problem in artificial intelligence. This is because the computational time of the algorithms provided by the literature is, in the worst case, exponential in the size of the game. In this paper, we present, to the best of our knowledge, the first anytime algorithm based on the combination of support enumeration methods and local search techniques to find a Nash equilibrium in two-player general-sum games. The algorithm searches for a Nash equilibrium and, if it is stopped before it has found an equilibrium, it returns the best approximate equilibrium found so far. We design some dimensions for our algorithm and we experimentally evaluate them. Our algorithm solves with high probability games that are unsolvable with the algorithms known in the literature within a reasonable time and provides good anytime performance.

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

[2]  Xiaotie Deng,et al.  Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[3]  Paul W. Goldberg,et al.  Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game , 2004, PODC '04.

[4]  Gerhard Weiss,et al.  Multiagent Systems , 1999 .

[5]  Christos H. Papadimitriou,et al.  The complexity of pure Nash equilibria , 2004, STOC '04.

[6]  Aranyak Mehta,et al.  A note on approximate Nash equilibria , 2006, Theor. Comput. Sci..

[7]  Michael P. Wellman,et al.  Stochastic Search Methods for Nash Equilibrium Approximation in Simulation-based Games , 2022 .

[8]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[9]  Aranyak Mehta,et al.  A Note on Approximate Nash Equilibria , 2006, WINE.

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

[11]  Thomas Stützle,et al.  Systematic vs. Local Search for SAT , 1999, KI.

[12]  Yoav Shoham,et al.  Simple search methods for finding a Nash equilibrium , 2004, Games Econ. Behav..

[13]  Emile H. L. Aarts,et al.  Theoretical aspects of local search , 2006, Monographs in Theoretical Computer Science. An EATCS Series.

[14]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[15]  Steven David Prestwich,et al.  Local Search for Very Large SAT Problems , 2004, SAT.

[16]  Nicola Basilico,et al.  Computing Bayes-Nash Equilibria through Support Enumeration Methods in Bayesian Two-Player Strategic-Form Games , 2009, 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology.

[17]  Yoav Shoham,et al.  Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .

[18]  Thomas L. Moore,et al.  LLC , 2022, The Fairchild Books Dictionary of Fashion.

[19]  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..

[20]  Vincent Conitzer,et al.  Mixed-Integer Programming Methods for Finding Nash Equilibria , 2005, AAAI.

[21]  M. Dufwenberg.  Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.

[22]  Paul W. Goldberg,et al.  The complexity of computing a Nash equilibrium , 2006, STOC '06.

[23]  John W. Chinneck,et al.  Feasibility and Infeasibility in Optimization:: Algorithms and Computational Methods , 2007 .

[24]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[25]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.