NP-hardness of Nash equilibrium decision problems persists for symmetric win-lose bimatrix games via win-lose gadgets and GHR-symmetrization.
On the Computational Complexity of Nash Equ ilibria for (0 , 1) Bimatrix Games,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Complexity of Computational Problems about Nash Equilibria in Symmetric Win-Lose Games
NP-hardness of Nash equilibrium decision problems persists for symmetric win-lose bimatrix games via win-lose gadgets and GHR-symmetrization.