Pure Nash equilibria: hard and easy games

In this paper we investigate complexity issues related to pure Nash equilibria of strategic games. We show that, even in very restrictive settings, determining whether a game has a pure Nash Equilibrium is NP-hard, while deciding whether a game has a strong Nash equilibrium is ΣP2-complete. We then study practically relevant restrictions that lower the complexity. In particular, we are interested in quantitative and qualitative restrictions of the way each player's move depends on moves of other players. We say that a game has small neighborhood if the utility function for each player depends only on (the actions of) a logarithmically small number of other players, The dependency structure of a game 𝒢 can he expressed by a graph G(𝒢) or by a hypergraph H(𝒢). Among other results, we show that if 𝒢 has small neighborhood and if H(𝒢) has bounded hypertree width (or if G(𝒢) has bounded treewidth), then finding pure Nash and Pareto equilibria is feasible in polynomial time. If the game is graphical, then these problems are LOGCFL-complete and thus in the class NC2 of highly parallelizable problems.

[1]  Yishay Mansour,et al.  Efficient Nash Computation in Large Population Games with Bounded Influence , 2002, UAI.

[2]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[3]  E. Maskin.  The Theory of Implementation in Nash Equilibrium: A Survey , 1983 .

[4]  YannakakisMihalis,et al.  On the Desirability of Acyclic Database Schemes , 1983 .

[5]  Georg Gottlob,et al.  Hypertree decompositions and tractable queries , 1998, PODS '99.

[6]  Daphne Koller,et al.  Multi-Agent Influence Diagrams for Representing and Solving Games , 2001, IJCAI.

[7]  Georg Gottlob,et al.  Computing LOGCFL certificates , 1999, Theor. Comput. Sci..

[8]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[9]  Ya'akov Gal,et al.  Reasoning about rationality and beliefs , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[10]  Christos H. Papadimitriou,et al.  Algorithms, games, and the internet , 2001, STOC '01.

[11]  Vincent Conitzer,et al.  Complexity Results about Nash Equilibria , 2002, IJCAI.

[12]  Allan Borodin,et al.  Two Applications of Inductive Counting for Complementation Problems , 1989, SIAM J. Comput..

[13]  L. Shapley,et al.  Potential Games , 1994 .

[14]  Xiaotie Deng,et al.  On the complexity of equilibria , 2002, STOC '02.

[15]  Eitan Zemel,et al.  Nash and correlated equilibria: Some complexity considerations , 1989 .

[16]  Daphne Koller,et al.  Multi-agent algorithms for solving graphical games , 2002, AAAI/IAAI.

[17]  Moshe Y. Vardi.  Constraint satisfaction and database theory: a tutorial , 2000, PODS.

[18]  Christos H. Papadimitriou,et al.  The complexity of pure Nash equilibria , 2004, STOC '04.

[19]  Luis E. Ortiz,et al.  Nash Propagation for Loopy Graphical Games , 2002, NIPS.

[20]  S. Vajda,et al.  Contribution to the Theory of Games , 1951 .

[21]  B. A. Reed,et al.  Algorithmic Aspects of Tree Width , 2003 .

[22]  Mihalis Yannakakis,et al.  On complexity as bounded rationality (extended abstract) , 1994, STOC '94.

[23]  Eric van Damme,et al.  Non-Cooperative Games , 2000 .

[24]  Mihalis Yannakakis,et al.  Algorithms for Acyclic Database Schemes , 1981, VLDB.

[25]  Christos H. Papadimitriou,et al.  On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..

[26]  Christos H. Papadimitriou,et al.  On Total Functions, Existence Theorems and Computational Complexity , 1991, Theor. Comput. Sci..

[27]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[28]  R. Rosenthal.  A class of games possessing pure-strategy Nash equilibria , 1973 .

[29]  R. McKelvey,et al.  Computation of equilibria in finite games , 1996 .

[30]  H. Venkateswaran,et al.  Properties that characterize LOGCFL , 1987, J. Comput. Syst. Sci..

[31]  Maria J. Serna,et al.  Pure Nash Equilibria in Games with a Large Number of Actions , 2005, MFCS.

[32]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[33]  Vincent Conitzer,et al.  Complexity of determining nonemptiness of the core , 2003, EC '03.

[34]  Francesco Scarcello,et al.  Non-Binary Constraints and Optimal Dual-Graph Representations , 2003, IJCAI.

[35]  Hans L. Bodlaender,et al.  Treewidth: Algorithmic Techniques and Results , 1997, MFCS.

[36]  Satinder Singh,et al.  An Efficient Exact Algorithm for Singly Connected Graphical Games , 2002, NIPS 2002.

[37]  1 What Is Game Theory Trying to Accomplish ? , 1985 .

[38]  Georg Gottlob,et al.  The complexity of acyclic conjunctive queries , 2001, JACM.

[39]  Paul G. Spirakis,et al.  The structure and complexity of Nash equilibria for a selfish routing game , 2002, Theor. Comput. Sci..

[40]  Francesco Scarcello,et al.  Constrained Pure Nash Equilibria in Graphical Games , 2004, ECAI.

[41]  Michael R. Fellows,et al.  FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .

[42]  Georg Gottlob,et al.  A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.

[43]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[44]  D. Koller,et al.  Efficient Computation of Equilibria for Extensive Two-Person Games , 1996 .

[45]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[46]  D. Koller,et al.  The complexity of two-person zero-sum games in extensive form , 1992 .

[47]  D. Koller,et al.  Finding mixed strategies with small supports in extensive form games , 1996 .

[48]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[49]  Moshe Tennenholtz,et al.  Local-Effect Games , 2003, IJCAI.

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

[51]  Francesco Scarcello,et al.  Bounding the Uncertainty of Graphical Games: The Complexity of Simple Requirements, Pareto and Strong Nash Equilibria , 2005, UAI.

[52]  Ronald Fagin,et al.  Degrees of acyclicity for hypergraphs and relational database schemes , 1983, JACM.