TY - GEN
T1 - Parameterized two-player Nash equilibrium
AU - Hermelin, Danny
AU - Huang, Chien Chung
AU - Kratsch, Stefan
AU - Wahlström, Magnus
PY - 2011/12/1
Y1 - 2011/12/1
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84855389475
U2 - 10.1007/978-3-642-25870-1_20
DO - 10.1007/978-3-642-25870-1_20
M3 - Conference contribution
AN - SCOPUS:84855389475
SN - 9783642258695
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 215
EP - 226
BT - Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Revised Papers
T2 - 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011
Y2 - 21 June 2011 through 24 June 2011
ER -