The University of Southampton
University of Southampton Institutional Repository

Nash Equilibria in Graphical Games on Trees Revisited

Elkind, Edith, Goldberg, Leslie Ann and Goldberg, Paul W., (2006) Nash Equilibria in Graphical Games on Trees Revisited Feigenbaum, Joan, Chuang, John C.-I. and Pennock, David M. (eds.) At 7th ACM Conference on Electronic Commerce (EC-2006), United States. 11 - 15 Jun 2006. , pp. 100-109.

Record type: Conference or Workshop Item (Paper)


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).

PDF Paper.pdf - Other
Download (365kB)

More information

Published date: 2006
Additional Information: Event Dates: June 11-15, 2006
Venue - Dates: 7th ACM Conference on Electronic Commerce (EC-2006), United States, 2006-06-11 - 2006-06-15
Organisations: Electronics & Computer Science


Local EPrints ID: 263441
PURE UUID: 238d2625-9c49-46c4-810e-f5d7e397922b

Catalogue record

Date deposited: 15 Feb 2007
Last modified: 18 Jul 2017 07:45

Export record


Author: Edith Elkind
Author: Leslie Ann Goldberg
Author: Paul W. Goldberg
Editor: Joan Feigenbaum
Editor: John C.-I. Chuang
Editor: David M. Pennock

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.