Title: Parallel Repetition of Two-Prover Games: A Survey, Applications, and a Counterexample to Strong Parallel Repetition
Speaker: Ran Raz, The Weizmann Institute of Science
Date: Thursday, May 15 2008
Time: 4:00PM to 5:00PM
Location: 32-G449(Patil)
I will give an introduction to the problem of parallel repetition of two-prover games and its applications to theoretical computer science, mathematics and physics. I will also describe a recent counterexample to the strong parallel repetition conjecture (a conjecture that would have had important applications). In a two-prover (alternatively, two-player) game, a referee chooses questions $(x,y)$ according to a (publicly known) distribution, and sends $x$ to the first player and $y$ to the second player. The first player responds by $a=a(x)$ and the second by $b=b(y)$ (without communicating with each other). The players jointly win if a (publicly known) predicate $V(x,y,a,b)$ holds. The value of the game is the maximal probability of success that the players can achieve, where the maximum is taken over all protocols $a=a(x),b=b(y)$.
more >>