A lower bound on the value of entangled binary games.
Salman BeigiPublished in: Quantum Inf. Comput. (2010)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- computer games
- video games
- optimal solution
- np hard
- nash equilibria
- objective function
- lower and upper bounds
- sample complexity
- polynomial approximation
- non binary
- game playing
- nash equilibrium
- educational games
- incomplete information
- worst case
- repeated games
- weighted majority
- hamming distance
- game theoretic
- game development
- learning agents
- learning games
- board game
- scheduling problem