@InProceedings{porter04a,
  author =	 {Ryan Porter and Eugene Nudelman and Yoav Shoham},
  title =	 {Simple Search Methods for Finding a Nash
                  Equilibrium},
  booktitle =	 {Proceedings of the Nineteenth National Conference on
                  Artificial Intelligence},
  year =	 2004,
  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.},
  keywords = 	 {game-theory},
  url = 	 {http://jmvidal.cse.sc.edu/library/porter04a.pdf}
}