Simple search methods for finding a Nash equilibrium

Authors:
Ryan Porter;Eugene Nudelman;Yoav Shoham
Affiliations:
Computer Science Department, Stanford University, Stanford, CA;Computer Science Department, Stanford University, Stanford, CA;Computer Science Department, Stanford University, Stanford, CA
Venue:
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Year:
2004

Citing 5
Cited 28

Simplicial variable dimension algorithms for solving the nonlinear complementarity problem on a product of unit simplices using a general labelling

Mathematics of Operations Research
Algorithms, games, and the internet

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Constraint Processing

Constraint Processing
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
A continuation method for Nash equilibria in structured games

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Complexity of (iterated) dominance

Proceedings of the 6th ACM conference on Electronic commerce
Using tabu best-response search to find pure strategy nash equilibria in normal form games

Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Computing the optimal strategy to commit to

EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Finding equilibria in large sequential games of imperfect information

EC '06 Proceedings of the 7th ACM conference on Electronic commerce
A technique for reducing normal-form games to compute a Nash equilibrium

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
AWESOME: A general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents

Machine Learning
Perspectives on multiagent learning

Artificial Intelligence
Lossless abstraction of imperfect information games

Journal of the ACM (JACM)
Computer science and game theory

Communications of the ACM - Designing games with a purpose
Computational analysis of perfect-information position auctions

Proceedings of the 10th ACM conference on Electronic commerce
Game Theoretical Insights in Strategic Patrolling: Model and Algorithm in Normal-Form

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Methods for empirical game-theoretic analysis

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Algorithms for rationalizability and CURB sets

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A generalized strategy eliminability criterion and computational methods for applying it

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Fast and compact: a simple class of congestion games

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Mixed-integer programming methods for finding Nash equilibria

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Approximate strategic reasoning through hierarchical reduction of large symmetric games

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Computing Bayes-Nash Equilibria through Support Enumeration Methods in Bayesian Two-Player Strategic-Form Games

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
The price of stability in selfish scheduling games

Web Intelligence and Agent Systems
Local search techniques for computing equilibria in two-player general-sum strategic-form games

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Computing exact and approximate Nash equilibria in 2-player games

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Algorithms for closed under rational behavior (CURB) sets

Journal of Artificial Intelligence Research
A game theoretic framework for heterogenous information network clustering

Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Computing a self-confirming equilibrium in two-player extensive-form games

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Solving strategic bargaining with arbitrary one-sided uncertainty

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Computing equilibria using interval constraints

CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
New results on the verification of Nash refinements for extensive-form games

Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Finding pure nash equilibrium of graphical game via constraints satisfaction approach

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.