Pure Nash Equilibria: Complete Characterization of Hard and Easy Graphical Games

We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special classes of graphs such as those with bounded treewidth. It is then natural to ask: is it possible to characterize all tractable classes of graphs for this problem? In this work, we provide such a characterization for the case of bounded in-degree graphs, thereby resolving the gap between existing hardness and tractability results. In particular, we analyze the complexity of PURE-GG(C, -), the problem of deciding the existence of pure Nash equilibria in graphical games whose underlying graphs are restricted to class C. We prove that, under reasonable complexity theoretic assumptions, for every recursively enumerable class C of directed graphs with bounded in-degree, PURE-GG(C, -) is in polynomial time if and only if the reduced graphs (the graphs resulting from iterated removal of sinks) of C have bounded treewidth. We also give a characterization for PURE-CHG(C, -), the problem of deciding the existence of pure Nash equilibria in colored hypergraphical games, a game representation that can express the additional structure that some of the players have identical local utility functions. We show that the tractable classes of bounded-arity colored hypergraphical games are precisely those whose reduced graphs have bounded treewidth modulo homomorphic equivalence. Our proofs make novel use of Grohe's characterization of the complexity of homomorphism problems.

[1]  Christos H. Papadimitriou,et al.  The Complexity of Games on Highly Regular Graphs , 2005, ESA.

[2]  Felix A. Fischer,et al.  Equilibria of Graphical Games with Symmetries , 2008, WINE.

[3]  Mohammad Ali Safari.  D-Width: A More Natural Measure for Directed Tree Width , 2005, MFCS.

[4]  Kevin Leyton-Brown,et al.  A Polynomial-Time Algorithm for Action Graph Games , 2006, AAAI.

[5]  Constantinos Daskalakis,et al.  Computing Pure Nash Equilibria via Markov Random Fields , 2005, ArXiv.

[6]  Felix Brandt,et al.  Symmetries and the complexity of pure Nash equilibrium , 2009, J. Comput. Syst. Sci..

[7]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[8]  Phokion G. Kolaitis,et al.  Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics , 2002, CP.

[9]  Felix A. Fischer,et al.  Equilibria of Graphical Games with Symmetries (Extended Abstract) , 2008 .

[10]  J. Nash.  NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

[11]  Stephan Kreutzer,et al.  Digraph measures: Kelly decompositions, games, and orderings , 2007, SODA '07.

[12]  Martin Grohe.  The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2007, JACM.

[13]  Christos H. Papadimitriou,et al.  Computing pure nash equilibria in graphical games via markov random fields , 2006, EC '06.

[14]  Ton Kloks.  Treewidth, Computations and Approximations , 1994, Lecture Notes in Computer Science.

[15]  Georg Gottlob,et al.  Pure Nash equilibria: hard and easy games , 2003, TARK '03.

[16]  Robin Thomas,et al.  Directed Tree-Width , 2001, J. Comb. Theory, Ser. B.

[17]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[18]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[19]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness I: Basic Results , 1995, SIAM J. Comput..

[20]  Michael L. Littman,et al.  Graphical Models for Game Theory , 2001, UAI.

[21]  Kevin Leyton-Brown,et al.  Computing Nash Equilibria of Action-Graph Games , 2004, UAI.

[22]  Peter Jonsson,et al.  The complexity of counting homomorphisms seen from the other side , 2004, Theor. Comput. Sci..

[23]  Jan Obdrzálek,et al.  DAG-width: connectivity measure for directed graphs , 2006, SODA '06.