Sciweavers

8 search results - page 1 / 2
» Parallel Repetition in Projection Games and a Concentration ...
Sort
View
ECCC
2008
99views more  ECCC 2008»
13 years 5 months ago
Parallel Repetition in Projection Games and a Concentration Bound
In a two player game, a referee asks two cooperating players (who are not allowed to communicate) questions sampled from some distribution and decides whether they win or not base...
Anup Rao
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 ...
ECCC
2010
82views more  ECCC 2010»
13 years 5 months ago
A Strong Parallel Repetition Theorem for Projection Games on Expanders
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
Ran Raz
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
FOCS
2008
IEEE
13 years 11 months ago
A Counterexample to Strong Parallel Repetition
The parallel repetition theorem states that for any two-prover game, with value 1 − (for, say, ≤ 1/2), the value of the game repeated in parallel n times is at most (1 − c)...
Ran Raz