A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model

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 most (1 − 3 )Ω(n/ log s) where s is the size of the answers set [Raz98],[Hol07]. It is not known how the value of the game decreases when there are three or more players. In this paper we address the problem of the error decrease of parallel repetition game for k-provers where k > 2. We consider a special case of the No-Signaling model and show that the error of the parallel repetition of k provers one round game, for k > 2, in this model, decreases exponentially depending only on the error of the original game and on the number of repetitions. There were no prior results for k-provers parallel repetition for k > 2 in any model.

• Type: Conference
• Year: 2010
• Where: COCOON
• Authors: Ricky Rosen
• Keywords: COCOON 2010, Combinatorics, Game, Parallel Repetition, Parallel Repetition Theorem