ML Anthology

Simple Search Methods for Finding a Nash Equilibrium

Ryan Porter, Eugene Nudelman, Yoav Shoham
AAAI 2004 pp. 664-669
/aaai/2004/porter2004aaai-simple/

Abstract

Nash equilibrium (NE) is arguably the most important concept in game theory, and yet remarkably little is known about the problem of computing a sample NE in a normal-form game. All evidence points to this being a hard problem,

PDF AAAI Semantic Scholar

Cite

Text

Porter et al. "Simple Search Methods for Finding a Nash Equilibrium." AAAI Conference on Artificial Intelligence, 2004.

Markdown

[Porter et al. "Simple Search Methods for Finding a Nash Equilibrium." AAAI Conference on Artificial Intelligence, 2004.](https://mlanthology.org/aaai/2004/porter2004aaai-simple/)

BibTeX

@inproceedings{porter2004aaai-simple,
  title     = {{Simple Search Methods for Finding a Nash Equilibrium}},
  author    = {Porter, Ryan and Nudelman, Eugene and Shoham, Yoav},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2004},
  pages     = {664-669},
  url       = {https://mlanthology.org/aaai/2004/porter2004aaai-simple/}
}