Computing nash equilibria of action-graph games via support enumeration

  • Authors:

  • David R. M. Thompson;Samantha Leung;Kevin Leyton-Brown

  • Affiliations:

  • University of British Columbia, Canada;Cornell University;University of British Columbia, Canada

  • Venue:
  • WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The support-enumeration method (SEM) for computation of Nash equilibrium has been shown to achieve state-of-the-art empirical performance on normal-form games. Action-graph games (AGGs) are exponentially smaller than the normal form on many important classes of games. We show how SEM can be extended to the AGG representation, yielding an exponential improvement in worst-case runtime. Empirically, we demonstrate that our AGG-optimized SEM algorithm substantially outperforms the original SEM, and also outperforms state-of-the-art AGG-optimized algorithms on most problem distributions.