8 search results - page 1 / 2 » Rounding Parallel Repetitions of Unique Games |
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
We show a tight relation between the behavior of unique games under parallel repetition and their semidefinite value. Let G be a unique game with alphabet size k. Suppose the semid...
COCO
2007
Springer
13 years 11 months ago
2007
Springer
Motivated by the study of Parallel Repetition and also by the Unique Games Conjecture, we investigate the value of the “Odd Cycle Games” under parallel repetition. Using tools...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
APPROX
2009
Springer
13 years 12 months ago
2009
Springer
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...