ML Anthology

Graphical Models for Game Theory

Michael J. Kearns, Michael L. Littman, Satinder Singh
UAI 2001 pp. 253-260
/uai/2001/kearns2001uai-graphical/

Abstract

We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equilibria in one-stage games represented by trees or sparse graphs.

UAI Semantic Scholar

Cite

Text

Kearns et al. "Graphical Models for Game Theory." Conference on Uncertainty in Artificial Intelligence, 2001.

Markdown

[Kearns et al. "Graphical Models for Game Theory." Conference on Uncertainty in Artificial Intelligence, 2001.](https://mlanthology.org/uai/2001/kearns2001uai-graphical/)

BibTeX

@inproceedings{kearns2001uai-graphical,
  title     = {{Graphical Models for Game Theory}},
  author    = {Kearns, Michael J. and Littman, Michael L. and Singh, Satinder},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {2001},
  pages     = {253-260},
  url       = {https://mlanthology.org/uai/2001/kearns2001uai-graphical/}
}