Graphical Models for Game Theory

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.

• Type: Conference
• Year: 2001
• Where: UAI
• Authors: Michael J. Kearns, Michael L. Littman, Satinder P. Singh
• Keywords: Approximate Nash Equilibria, Compact Graph-theoretic Representation, Multi-party Game Theory, UAI 2001, UAI 2008