Sciweavers

Share
SIGECOM
2006
ACM

Computing pure nash equilibria in graphical games via markov random fields

8 years 10 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, when combined with the junction tree algorithm for statistical inference, yields a unified proof of all previously known tractable cases of the NP-complete problem of finding pure Nash equilibria in graphical games, but also implies efficient algorithms for new classes, such as the games with O(log n) treewidth. Furthermore, this important problem becomes susceptible to a wealth of sophisticated and empirically successful techniques from Machine Learning. Categories and Subject Descriptors F.2.0 [Analysis of Algorithms and Problem Complexity]:General General Terms Algorithms, Economics, Theory Keywords Nash Equilibrium, Markov Random Fields, Treewidth
Constantinos Daskalakis, Christos H. Papadimitriou
Added 14 Jun 2010
Updated 14 Jun 2010
Type Conference
Year 2006
Where SIGECOM
Authors Constantinos Daskalakis, Christos H. Papadimitriou
Comments (0)
books