Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

AAAI
2004

favoriteEmaildiscussreport

99views Intelligent Agents» more AAAI 2004»

Simple Search Methods for Finding a Nash Equilibrium

13 years 6 months ago

Simple Search Methods for Finding a Nash Equilibrium

Download www.cs.ubc.ca

We present two simple search methods for computing a sample Nash equilibrium in a normal-form game: one for 2player 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

Ryan Porter, Eugene Nudelman, Yoav Shoham

Real-time Traffic

AAAI 2004 | Intelligent Agents | N-player Games | Sample Nash Equilibrium | Simple Search Methods |

claim paper

Related Content

» Local Search Methods for Finding a Nash Equilibrium in TwoPlayer Games

» The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games

» Stochastic search methods for nash equilibrium approximation in simulationbased games

» Nearoptimal network design with selfish agents

» Optimality and Complexity of Pure Nash Equilibria in the Coverage Game

» A Polynomial Time Algorithm for Finding Nash Equilibria in Planar WinLose Games

» Decision Problems for Nash Equilibria in Stochastic Games

» GradientBased Algorithms for Finding Nash Equilibria in Extensive Form Games

» Search for Dynamic Equilibrium in Duel Problems by Global Optimization

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2004
Where	AAAI
Authors	Ryan Porter, Eugene Nudelman, Yoav Shoham

Comments (0)