On the Complexity of Two-PlayerWin-Lose Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The complexity of uniform Nash equilibria and related regular subgraph problems
Theoretical Computer Science
The structure and complexity of Nash equilibria for a selfish routing game
Theoretical Computer Science
How hard is it to find extreme Nash equilibria in network congestion games?
Theoretical Computer Science
Complexity results about Nash equilibria
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
On the computational complexity of Nash equilibria for (0,1) bimatrix games
Information Processing Letters
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
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Parameterized two-player nash equilibrium
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
We know that k-UNIFORM NASH is W[2]-Complete when we consider imitation symmetric win-lose games (with k as the parameter) even when we have two players. However, this paper provides positive results regarding Nash equilibria. We show that consideration of sparse games or limitations of the support result in fixed-parameter algorithms with respect to one parameter only for the k-Uniform Nash problem. That is, we show that a sample uniform Nash equilibrium in r-sparse imitation symmetric win-lose games is not as hard because it can be found in FPT time (i.e polynomial in the size of the game, but maybe exponential in r). Moreover, we show that, although NP-Complete, the problem of BEST NASH EQUILIBRIUM is also fix-parameter tractable.