Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
On the Complexity of Two-PlayerWin-Lose Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Reducibility among equilibrium problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Settling the Complexity of Two-Player Nash Equilibrium
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Computing Nash Equilibria: Approximation and Smoothed Complexity
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Progress in approximate nash equilibria
Proceedings of the 8th ACM conference on Electronic commerce
Efficient computation of nash equilibria for very sparse win-lose bimatrix games
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
The approximation complexity of win-lose games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Games of fixed rank: a hierarchy of bimatrix games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Game Theory
The complexity of computing a Nash equilibrium
Communications of the ACM - Inspiring Women in Computing
A note on approximate Nash equilibria
Theoretical Computer Science
On oblivious PTAS's for nash equilibrium
Proceedings of the forty-first annual ACM symposium on Theory of computing
On problems without polynomial kernels
Journal of Computer and System Sciences
New algorithms for approximate Nash equilibria in bimatrix games
Theoretical Computer Science
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
Algorithms for playing games with limited randomness
ESA'07 Proceedings of the 15th annual European conference on Algorithms
An optimization approach for approximate Nash equilibria
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Computing Nash equilibria gets harder: new results show hardness even for parameterized complexity
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Exploiting concavity in bimatrix games: new polynomially tractable subclasses
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Infeasibility of instance compression and succinct PCPs for NP
Journal of Computer and System Sciences
Single parameter FPT-algorithms for non-trivial games
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Parameterized Complexity
| Hi-index | 0.00 |
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.