Sciweavers

15 search results - page 1 / 3
» Improved Rounding for Parallel Repeated Unique Games
Sort
View
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
13 years 6 months ago
Improved Rounding for Parallel Repeated Unique Games
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...
David Steurer
APPROX
2009
Springer
108views Algorithms» more  APPROX 2009»
13 years 11 months ago
Strong Parallel Repetition Theorem for Free Projection Games
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...
Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen ...
FOCS
2008
IEEE
13 years 11 months ago
Rounding Parallel Repetitions of Unique Games
Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, O...
COCO
2007
Springer
84views Algorithms» more  COCO 2007»
13 years 11 months ago
Understanding Parallel Repetition Requires Understanding Foams
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...
Uriel Feige, Guy Kindler, Ryan O'Donnell
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
14 years 5 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...