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 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

• Type: Conference
• Year: 2004
• Where: AAAI
• Authors: Ryan Porter, Eugene Nudelman, Yoav Shoham
• Keywords: AAAI 2004, Intelligent Agents, N-player Games, Sample Nash Equilibrium, Simple Search Methods