Parameterized two-player nash equilibrium

Danny Hermelin, Chien Chung Huang, Stefan Kratsch, Magnus Wahlström

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


We study the problem of computing Nash equilibria in a two-player normal form (bimatrix) game from the perspective of parameterized complexity. Recent results proved hardness for a number of variants, when parameterized by the support size. We complement those results, by identifying three cases in which the problem becomes fixed-parameter tractable. Our results are based on a graph-theoretic representation of a bimatrix game, and on applying graph-theoretic tools on this representation.

Original languageEnglish
Pages (from-to)802-816
Number of pages15
Issue number4
StatePublished - 1 Apr 2013
Externally publishedYes


  • Algorithms
  • Nash equilibrium
  • Parameterized complexity
  • Two-player games

ASJC Scopus subject areas

  • General Computer Science
  • Computer Science Applications
  • Applied Mathematics


Dive into the research topics of 'Parameterized two-player nash equilibrium'. Together they form a unique fingerprint.

Cite this