NP-hardness of Computing Uniform Nash Equilibria on Planar Bimatrix Game.
Takashi IshizukaNaoyuki KamiyamaPublished in: CoRR (2022)
Keyphrases
- nash equilibria
- np hardness
- game theory
- np hard
- incomplete information
- nash equilibrium
- stochastic games
- pure strategy
- game theoretic
- fictitious play
- approximation algorithms
- subgame perfect
- solution concepts
- mixed integer
- cooperative
- multi agent systems
- markov decision processes
- computational complexity
- congestion games
- normal form games