Graphical Models for Game Theory
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Multi-agent algorithms for solving graphical games
Eighteenth national conference on Artificial intelligence
Computing approximate bayes-nash equilibria in tree-games of incomplete information
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
A polynomial-time Nash equilibrium algorithm for repeated games
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Self-interested database managers playing the view maintenance game
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Exploiting locality of interaction in factored Dec-POMDPs
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Finding a nash equilibrium by asynchronous backtracking
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A study on the stability and efficiency of graphical games with unbounded treewidth
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
| Hi-index | 0.00 |
We formulate the problem of computing equilibria in multi-player 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.