On the Structure of Weakly Acyclic Games

Alex Fabrikant, Aaron D. Jaggard, Michael Schapira

Research output: Contribution to journalArticlepeer-review


The class of weakly acyclic games, which includes potential games and dominance-solvable games, captures many practical application domains. In a weakly acyclic game, from any starting state, there is a sequence of better-response moves that leads to a pure Nash equilibrium; informally, these are games in which natural distributed dynamics, such as better-response dynamics, cannot enter inescapable oscillations. We establish a novel link between such games and the existence of pure Nash equilibria in subgames. Specifically, we show that the existence of a unique pure Nash equilibrium in every subgame implies the weak acyclicity of a game. In contrast, the possible existence of multiple pure Nash equilibria in every subgame is insufficient for weak acyclicity in general; here, we also systematically identify the special cases (in terms of the number of players and strategies) for which this is sufficient to guarantee weak acyclicity.

Original languageEnglish
Pages (from-to)107-122
Number of pages16
JournalTheory of Computing Systems
Issue number1
StatePublished - Jul 2013


  • Subgame stability
  • Weak acyclicity

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computational Theory and Mathematics


Dive into the research topics of 'On the Structure of Weakly Acyclic Games'. Together they form a unique fingerprint.

Cite this