Equilibria of Graphical Games with Symmetries (Extended Abstract)

We study graphical games where the payoff function of each player satisfies one of four types of symmetry in the actions of his neigh- bors. We establish that deciding the existence of a pure Nash equilibrium is NP-hard in general for all four types. Using a characterization of games with pure equilibria in terms of even cycles in the neighborhood graph, as well as a connection to a generalized satisfiability problem, we identify tractable subclasses of the games satisfying the most restrictive type of symmetry. Hardness for a different subclass is obtained via a satisfiabil- ity problem that remains NP-hard in the presence of a matching, a result that may be of independent interest. Finally, games with symmetries of two of the four types are shown to possess a symmetric mixed equilib- rium which can be computed in polynomial time. We thus obtain a class of games where the pure equilibrium problem is computationally harder than the mixed equilibrium problem, unless P=NP.

[1]  Christos H. Papadimitriou,et al.  Computing Equilibria in Anonymous Games , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[2]  Edith Elkind,et al.  Computing good nash equilibria in graphical games , 2007, EC '07.

[3]  Felix A. Fischer,et al.  Symmetries and the complexity of pure Nash equilibrium , 2007, J. Comput. Syst. Sci..

[4]  Stefan Katzenbeisser,et al.  The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria , 2006, Inf. Process. Lett..

[5]  Grant Schoenebeck,et al.  The computational complexity of nash equilibria in concisely represented games , 2006, EC '06.

[6]  Edith Elkind,et al.  Nash equilibria in graphical games on trees revisited , 2006, EC '06.

[7]  Paul W. Goldberg,et al.  Reducibility among equilibrium problems , 2006, STOC '06.

[8]  Paul W. Goldberg,et al.  The complexity of computing a Nash equilibrium , 2006, STOC '06.

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

[10]  Tim Roughgarden,et al.  Computing equilibria in multi-player games , 2005, SODA '05.

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

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

[13]  P. Seymour,et al.  PERMANENTS, PFAFFIAN ORIENTATIONS, AND EVEN DIRECTED CIRCUITS , 1999, STOC 1997.

[14]  Carsten Thomassen,et al.  Even Cycles in Directed Graphs , 1985, Eur. J. Comb..

[15]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[16]  Rohit Parikh,et al.  On Context-Free Languages , 1966, JACM.

[17]  Howard Raiffa,et al.  Games and Decisions: Introduction and Critical Survey. , 1958 .

[18]  P. Seymour ON THE TWO-COLOURING OF HYPERGRAPHS , 1974 .