Two-Player Entangled Games are NP-Hard.
Anand NatarajanThomas VidickPublished in: Computational Complexity Conference (2018)
Keyphrases
- np hard
- nash equilibria
- perfect information
- nash equilibrium
- game theoretic
- imperfect information
- learning agents
- game playing
- repeated games
- game theory
- stochastic games
- worst case
- linear programming
- optimal solution
- lower bound
- scheduling problem
- decision problems
- special case
- approximation algorithms
- minimum cost
- incomplete information
- computer games
- multi player
- closely related
- np hardness
- np complete
- integer programming
- computational complexity
- game design
- set cover
- solution concepts
- multi agent
- boolean variables
- remains np hard
- learning games
- serious games