Computing pure nash equilibria in graphical games via markov random fields
Computing pure nash equilibria in graphical games via markov random fields
复制标题
通过马尔可夫随机场计算图形游戏中的纯纳什均衡
DOI：
10.1145/1134707.1134718
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
C. Papadimitriou
中科院分区：
文献类型：
--
作者：
C. Daskalakis;C. Papadimitriou
我们提出了一个减少从图形游戏到马尔可夫随机场，使纯粹的纳什均衡在前者可以找到后者的统计推断。我们的研究结果，结合统计推断的联合树算法，产生一个统一的证明所有以前已知的NP-完全问题，在图形游戏中找到纯纳什均衡的易处理的情况下，但也意味着有效的算法，新的类，如游戏与O（log n）树宽。此外，这个重要的问题变得容易受到机器学习中大量复杂和经验上成功的技术的影响。
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.
影响因子：
32.8
作者：
Wainwright, Martin J.;Jordan, Michael I.
通讯作者：
Jordan, Michael I.