Computing Pure Nash Equilibria in Symmetric Action Graph Games
暂无分享,去创建一个
[1] Michael L. Littman,et al. Graphical Models for Game Theory , 2001, UAI.
[2] Kevin Leyton-Brown,et al. Computing Nash Equilibria of Action-Graph Games , 2004, UAI.
[3] Christos H. Papadimitriou,et al. Computing pure nash equilibria in graphical games via markov random fields , 2006, EC '06.
[4] Eric van Damme,et al. Non-Cooperative Games , 2000 .
[5] Georg Gottlob,et al. Pure Nash equilibria: hard and easy games , 2003, TARK '03.
[6] Ton Kloks. Treewidth, Computations and Approximations , 1994, Lecture Notes in Computer Science.
[7] Felix A. Fischer,et al. Symmetries and the complexity of pure Nash equilibrium , 2007, J. Comput. Syst. Sci..
[8] B. A. Reed,et al. Algorithmic Aspects of Tree Width , 2003 .
[9] Yoav Shoham,et al. Fast and Compact: A Simple Class of Congestion Games , 2005, AAAI.
[10] Xiaotie Deng,et al. Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[11] Constantinos Daskalakis,et al. Computing Pure Nash Equilibria via Markov Random Fields , 2005, ArXiv.
[12] Dan Geiger,et al. A sufficiently fast algorithm for finding close to optimal clique trees , 2001, Artif. Intell..
[13] Kevin Leyton-Brown,et al. A Polynomial-Time Algorithm for Action Graph Games , 2006, AAAI.