Inapproximability of NP-Complete Variants of Nash Equilibrium.
Per AustrinMark BravermanEden ChlamtacPublished in: Theory Comput. (2013)
Keyphrases
- nash equilibrium
- np complete
- game theory
- np hard
- approximation algorithms
- game theoretic
- worst case
- nash equilibria
- pareto optimal
- randomly generated
- stackelberg game
- variational inequalities
- computational complexity
- polynomial time complexity
- solution concepts
- mixed strategy
- pure strategy
- stochastic games
- fictitious play
- linear programming
- repeated games
- regret minimization
- coalition formation
- lower bound
- equilibrium strategies
- reinforcement learning
- pure nash equilibria