Sciweavers

Share
ATAL
2007
Springer

Constraint satisfaction algorithms for graphical games

9 years 4 months ago
Constraint satisfaction algorithms for graphical games
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. The first is PureProp: an algorithm for computing approximate Nash equilibria in complete information one-shot games and approximate Bayes-Nash equilibria in one-shot games of incomplete information. PureProp unifies existing message-passing based algorithms for solving these classes of games. We also address repeated graphical games, and present a second algorithm, PureProp-R, for computing approximate Nash equilibria in these games. Categories and Subject Descriptors I.2 [Artificial Intelligence]; F.2 [Analysis of Algorithms] General Terms Algorithms, Economics, Theory Keywords graphical games, constraint satisfaction
Vishal Soni, Satinder P. Singh, Michael P. Wellman
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where ATAL
Authors Vishal Soni, Satinder P. Singh, Michael P. Wellman
Comments (0)
books