Treewidth and Pure Nash Equilibria
暂无分享,去创建一个
[1] Georg Gottlob,et al. Hypertree Decompositions: Structure, Algorithms, and Applications , 2005, WG.
[2] Dániel Marx,et al. Can you beat treewidth? , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[3] Dan Geiger,et al. A sufficiently fast algorithm for finding close to optimal clique trees , 2001, Artif. Intell..
[4] Kevin Leyton-Brown,et al. Computing Pure Nash Equilibria in Symmetric Action Graph Games , 2007, AAAI.
[5] Xiaotie Deng,et al. Settling the complexity of computing two-player Nash equilibria , 2007, JACM.
[6] Michael R. Fellows,et al. On problems without polynomial kernels , 2009, J. Comput. Syst. Sci..
[7] Arie M. C. A. Koster,et al. Combinatorial Optimization on Graphs of Bounded Treewidth , 2008, Comput. J..
[8] Anders Yeo,et al. Kernel Bounds for Disjoint Cycles and Disjoint Paths , 2009, ESA.
[9] Paul W. Goldberg,et al. The Complexity of Computing a Nash Equilibrium , 2009, SIAM J. Comput..
[10] Albert Xin Jiang,et al. Pure Nash Equilibria: Complete Characterization of Hard and Easy Graphical Games , 2010, AAMAS.
[11] Andrew Drucker,et al. New Limits to Classical and Quantum Instance Compression , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[12] Francesco Scarcello,et al. On the complexity of constrained Nash equilibria in graphical games , 2009, Theor. Comput. Sci..
[13] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[14] Hans L. Bodlaender,et al. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.
[15] Christos H. Papadimitriou,et al. Computing pure nash equilibria in graphical games via markov random fields , 2006, EC '06.
[16] Rolf Niedermeier,et al. Invitation to Fixed-Parameter Algorithms , 2006 .
[17] Kevin Leyton-Brown,et al. Action-Graph Games , 2011, Games Econ. Behav..
[18] Michael L. Littman,et al. Graphical Models for Game Theory , 2001, UAI.
[19] Constantinos Daskalakis,et al. On the complexity of Nash equilibria of action-graph games , 2008, SODA.
[20] Michael R. Fellows,et al. On the parameterized complexity of multiple-interval graph problems , 2009, Theor. Comput. Sci..
[21] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.
[22] Amos Fiat,et al. Algorithms - ESA 2009 , 2009, Lecture Notes in Computer Science.