Nash Equilibria in Graphical Games on Trees Revisited

Abstract

Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying graph has low degree, they provide a concise way to represent the players' payoffs. It has recently been shown that the problem of finding Nash equilibria in a general degree-3 graphical game with two actions per player is complete for the complexity class PPAD, indicating that it is unlikely that there is any polynomial-time algorithm for this problem. In this paper, we study the complexity of graphical games with two actions per player on bounded-degree trees. This setting was first considered by Kearns, Littman and Singh, who proposed a dynamic programming-based algorithm that computes all Nash equilibria of such games. The running time of their algorithm is exponential, though approximate equilibria can be computed efficiently. Later, Littman, Kearns and Singh proposed a modification to this algorithm that can find a single Nash equilibrium in polynomial time. We show that this modified algorithm is incorrect --- the output is not always a Nash equilibrium. On the other hand, we propose a new algorithm that is based on the ideas of Kearns et al. and computes all Nash equilibria in quadratic time if the input graph is a path, and in polynomial time if it is an arbitrary graph of maximum degree~$2$. Moreover, our algorithm can be used to compute Nash equilibria of graphical games on arbitrary trees, but the running time can be exponential, even when the tree has bounded degree. We show that this is inevitable --- any algorithm of this type will take exponential time, even on bounded-degree trees with pathwidth~$2$. It is an open question whether our algorithm runs in polynomial time on graphs with pathwidth~$1$ but we show that finding a Nash equilibrium for a 2-action graphical game in which the underlying graph has maximum degree~$3$ and constant pathwidth is PPAD-complete (so is unlikely to be tractable).

More information

Identifiers

Catalogue record

Export record