Local Search Techniques for Nash Equilibrium Computation with Bimatrix Games

[1]  Nicola Gatti,et al.  Local Search Methods for Finding a Nash Equilibrium in Two-Player Games , 2010, 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[2]  Paul G. Spirakis,et al.  Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games , 2007, ICALP.

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

[4]  Carla P. Gomes,et al.  Randomized Backtrack Search , 2004 .

[5]  D. Avis,et al.  Enumeration of Nash equilibria for two-player games , 2010 .

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

[7]  Aranyak Mehta,et al.  Playing large games using simple strategies , 2003, EC '03.

[8]  Evangelos Markakis,et al.  New algorithms for approximate Nash equilibria in bimatrix games , 2007, Theor. Comput. Sci..

[9]  J. K. Lenstra,et al.  Local search in combinatorial optimization (2nd revised edition) , 2003 .

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

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

[12]  Bart Selman,et al.  Heavy-Tailed Distributions in Combinatorial Search , 1997, CP.

[13]  Anne Balthasar.  Equilibrium Tracing in Bimatrix Games , 2007, Equilibrium Computation.

[14]  Nicola Gatti,et al.  Local search techniques for computing equilibria in two-player general-sum strategic-form games , 2010, AAMAS.

[15]  H. Arndt von Schemde.  Index and Stability in Bimatrix Games: A Geometric-Combinatorial Approach , 2005 .

[16]  Bernhard von Stengel,et al.  Exponentially many steps for finding a Nash equilibrium in a bimatrix game , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[17]  Shang-Hua Teng,et al.  Foundations of Computational Mathematics, Santander 2005: Smoothed Analysis of Algorithms and Heuristics , 2006 .

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

[19]  Christos H. Papadimitriou,et al.  Algorithms, games, and the internet , 2001, STOC '01.

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

[21]  Nimrod Megiddo,et al.  On the expected number of linear complementarity cones intersected by random and semi-random rays , 1986, Math. Program..

[22]  K. G. Murty.  Computational complexity of complementary pivot methods , 1978 .

[23]  Rahul Savani.  Finding Nash equilibria of bimatrix games , 2006 .

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

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

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

[27]  Paul G. Spirakis,et al.  An Optimization Approach for Approximate Nash Equilibria , 2007, WINE.

[28]  Xi Chen,et al.  Computing Nash Equilibria: Approximation and Smoothed Complexity , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).