Erratum: Three-Player Entangled XOR Games are NP-hard to Approximate.
Thomas VidickPublished in: SIAM J. Comput. (2020)
Keyphrases
- np hard
- game play
- boolean games
- two player games
- repeated games
- pure nash equilibria
- imperfect information
- multi player
- approximate solutions
- game players
- game theoretic
- board game
- video games
- np complete
- lower bound
- scheduling problem
- special case
- approximation algorithms
- computer poker
- linear programming
- game mechanics
- evaluation function
- optimal solution
- human players
- computational complexity
- game theory
- computer games
- game playing
- playing games
- worst case
- decision problems
- greedy heuristic
- game design
- nash equilibria
- online game
- nash equilibrium
- e learning
- opponent modeling
- closely related
- integer programming
- general game playing
- digital games
- incomplete information
- virtual environment
- educational games
- serious games
- pure nash equilibrium
- np hardness