Graphical Models for Game Theory

13 years 6 months ago

Download www.cis.upenn.edu

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.

Michael J. Kearns, Michael L. Littman, Satinder P.

Real-time Traffic

Approximate Nash Equilibria | Compact Graph-theoretic Representation | Multi-party Game Theory | UAI 2001 | UAI 2008 |

claim paper

» Using conflict theory to model complex societal interactions

» The attack of the backstories and why they wont win

» Dynamics in Network Interaction Games

» Graphical Economics

» Theory as Game Designing the Game Game

» Cognitive Modeling of KnowledgeGuided Information Acquisition in Games

» Game Motivation and Effective Learning An Integrated Model for Educational Game Design

» Constraint satisfaction algorithms for graphical games

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2001
Where	UAI
Authors	Michael J. Kearns, Michael L. Littman, Satinder P. Singh

Comments (0)

Sciweavers

Graphical Models for Game Theory

Approximate Nash Equilibria | Compact Graph-theoretic Representation | Multi-party Game Theory | UAI 2001 | UAI 2008 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers