Three-Player Entangled XOR Games are NP-Hard to Approximate.
Thomas VidickPublished in: SIAM J. Comput. (2016)
Keyphrases
- np hard
- game play
- repeated games
- boolean games
- imperfect information
- approximate solutions
- board game
- pure nash equilibria
- two player games
- game players
- np complete
- computer poker
- scheduling problem
- game mechanics
- lower bound
- multi player
- closely related
- special case
- video games
- game theoretic
- approximation algorithms
- computer games
- educational games
- minimum cost
- game design
- optimal solution
- integer programming
- card game
- np hardness
- human players
- game playing
- serious games
- minimax search
- playing games
- decision problems
- worst case
- computational complexity
- opponent modeling
- piecewise linear
- pure nash equilibrium
- remains np hard
- perfect information
- human computation
- game development
- greedy heuristic
- online game
- learning processes
- evaluation function
- greedy algorithm
- incomplete information
- game theory
- linear programming
- cooperative