# Algorithms, Bounds, and Strategies for Entangled XOR Games

We study the complexity of computing the commuting-operator value ω^* of entangled XOR games with any number of players. We introduce necessary and sufficient criteria for an XOR game to have ω^* = 1, and use these criteria to derive the following results: 1. An algorithm for symmetric games that decides in polynomial time whether ω^* = 1 or ω^* < 1, a task that was not previously known to be decidable, together with a simple tensor-product strategy that achieves value 1 in the former case. The only previous candidate algorithm for this problem was the Navascués-Pironio-Acín (also known as noncommutative Sum of Squares or ncSoS) hierarchy, but no convergence bounds were known. 2. A family of games with three players and with ω^* < 1, where it takes doubly exponential time for the ncSoS algorithm to witness this (in contrast with our algorithm which runs in polynomial time). 3. A family of games achieving a bias difference 2(ω^* - ω) arbitrarily close to the maximum possible value of 1 (and as a consequence, achieving an unbounded bias ratio), answering an open question of Briët and Vidick. 4. Existence of an unsatisfiable phase for random (non-symmetric) XOR games: that is, we show that there exists a constant C_k^unsat depending only on the number k of players, such that a random k-XOR game over an alphabet of size n has ω^* < 1 with high probability when the number of clauses is above C_k^unsat n. 5. A lower bound of Ω(n (n)/(n)) on the number of levels in the ncSoS hierarchy required to detect unsatisfiability for most random 3-XOR games. This is in contrast with the classical case where the n-th level of the sum-of-squares hierarchy is equivalent to brute-force enumeration of all possible solutions.

• 5 publications
• 5 publications
• 12 publications
• 9 publications
10/30/2020

### 3XOR Games with Perfect Commuting Operator Strategies Have Perfect Tensor Product Strategies and are Decidable in Polynomial Time

We consider 3XOR games with perfect commuting operator strategies. Given...
07/16/2020

### Solving Random Parity Games in Polynomial Time

We consider the problem of solving random parity games. We prove that pa...
05/24/2022

### Linearly representable games and pseudo-polynomial calculation of the Shapley value

We introduce the notion of linearly representable games. Broadly speakin...
03/22/2023

### Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Games

We consider the problem of decentralized multi-agent reinforcement learn...
10/08/2017

### The space complexity of mirror games

We consider a simple streaming game between two players Alice and Bob, w...
04/12/2021

### How Asymmetry Helps Buffer Management: Achieving Optimal Tail Size in Cup Games

The cup game on n cups is a multi-step game with two players, a filler a...
01/13/2020

### One-Clock Priced Timed Games are PSPACE-hard

The main result of this paper is that computing the value of a one-clock...