TY - GEN

T1 - Derandomized parallel repetition theorems for free games

AU - Shaltiel, Ronen

PY - 2010

Y1 - 2010

N2 - Raz's parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1-∈ (for ∈ ≤ 1/2), the value of the game repeated n times in parallel on independent inputs is at most (1-∈) Ω(∈2n/ℓ) where ℓ is the answer length of the game. For free games (which are games in which the inputs to the two players are uniform and independent) the constant 2 can be replaced with 1 by a result of Barak, Rao, Raz, Rosen and Shaltiel [1]. Consequently, n = O(tℓ/∈) repetitions suffice to reduce the value of a free game from 1-∈ to (1-∈)t, and denoting the input length of the game by m, if follows that nm = O(tℓm/∈) random bits can be used to prepare n independent inputs for the parallel repetition game. In this paper we prove a derandomized version of the parallel repetition theorem for free games and show that O(t(m+ℓ)) random bits can be used to generate correlated inputs such that the value of the parallel repetition game on these inputs has the same behavior. Thus, in terms of randomness complexity, correlated parallel repetition can reduce the value of free games at the "correct rate" when ℓ = O(m). Our technique uses strong extractors to " derandomize" a lemma of [21], and can be also used to derandomize a parallel repetition theorem of Parnafes, Raz and Wigderson [20] for communication games in the special case that the game is free.

AB - Raz's parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1-∈ (for ∈ ≤ 1/2), the value of the game repeated n times in parallel on independent inputs is at most (1-∈) Ω(∈2n/ℓ) where ℓ is the answer length of the game. For free games (which are games in which the inputs to the two players are uniform and independent) the constant 2 can be replaced with 1 by a result of Barak, Rao, Raz, Rosen and Shaltiel [1]. Consequently, n = O(tℓ/∈) repetitions suffice to reduce the value of a free game from 1-∈ to (1-∈)t, and denoting the input length of the game by m, if follows that nm = O(tℓm/∈) random bits can be used to prepare n independent inputs for the parallel repetition game. In this paper we prove a derandomized version of the parallel repetition theorem for free games and show that O(t(m+ℓ)) random bits can be used to generate correlated inputs such that the value of the parallel repetition game on these inputs has the same behavior. Thus, in terms of randomness complexity, correlated parallel repetition can reduce the value of free games at the "correct rate" when ℓ = O(m). Our technique uses strong extractors to " derandomize" a lemma of [21], and can be also used to derandomize a parallel repetition theorem of Parnafes, Raz and Wigderson [20] for communication games in the special case that the game is free.

KW - Derandomization

KW - Parallel repetition

KW - Randomness extractors

UR - http://www.scopus.com/inward/record.url?scp=77955258343&partnerID=8YFLogxK

U2 - 10.1109/CCC.2010.12

DO - 10.1109/CCC.2010.12

M3 - Conference contribution

AN - SCOPUS:77955258343

SN - 9780769540603

T3 - Proceedings of the Annual IEEE Conference on Computational Complexity

SP - 28

EP - 37

BT - Proceedings - 25th Annual IEEE Conference on Computational Complexity, CCC 2010

T2 - 25th Annual IEEE Conference on Computational Complexity, CCC 2010

Y2 - 9 June 2010 through 11 June 2010

ER -