A New Proof of Nonsignalling Multiprover Parallel Repetition Theorem

01/30/2019

∙

by   Himanshu Tyagi, et al.

∙

0

∙

share

We present an information theoretic proof of the nonsignalling multiprover parallel repetition theorem, a recent extension of its two-prover variant that underlies many hardness of approximation results. The original proofs used de Finetti type decomposition for strategies. We present a new proof that is based on a technique we introduced recently for proving strong converse results in multiuser information theory and entails a change of measure after replacing hard information constraints with soft ones.