Parameterized Two-Player Nash Equilibrium

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

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 GB
Title of host publicationGraph-Theoretic Concepts in Computer Science
Subtitle of host publication37th International Workshop, WG 2011, Revised Papers
EditorsPetr Kolman, Jan Kratochvíl
PublisherSpringer
Pages215-226
Number of pages12
ISBN (Print)978-3-642-25870-1
DOIs
StatePublished - 2011
Externally publishedYes
Event37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011 - Tepla Monastery, Czech Republic
Duration: 21 Jun 201124 Jun 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Volume6986
ISSN (Print)0302-9743

Conference

Conference37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011
Country/TerritoryCzech Republic
CityTepla Monastery
Period21/06/1124/06/11

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Parameterized Two-Player Nash Equilibrium'. Together they form a unique fingerprint.

Cite this