ML Anthology

An Efficient, Exact Algorithm for Solving Tree-Structured Graphical Games

Michael L. Littman, Michael J. Kearns, Satinder P. Singh
NeurIPS 2001 pp. 817-823
/neurips/2001/littman2001neurips-efficient/

Abstract

We describe a new algorithm for computing a Nash equilibrium in graphical games, a compact representation for multi-agent systems that we introduced in previous work. The algorithm is the first to compute equilibria both efficiently and exactly for a non-trivial class of graphical games.

PDF NeurIPS Semantic Scholar

Cite

Text

Littman et al. "An Efficient, Exact Algorithm for Solving Tree-Structured Graphical Games." Neural Information Processing Systems, 2001.

Markdown

[Littman et al. "An Efficient, Exact Algorithm for Solving Tree-Structured Graphical Games." Neural Information Processing Systems, 2001.](https://mlanthology.org/neurips/2001/littman2001neurips-efficient/)

BibTeX

@inproceedings{littman2001neurips-efficient,
  title     = {{An Efficient, Exact Algorithm for Solving Tree-Structured Graphical Games}},
  author    = {Littman, Michael L. and Kearns, Michael J. and Singh, Satinder P.},
  booktitle = {Neural Information Processing Systems},
  year      = {2001},
  pages     = {817-823},
  url       = {https://mlanthology.org/neurips/2001/littman2001neurips-efficient/}
}