Summary: Rounding Parallel Repetitions of Unique Games
Boaz Barak
Princeton University
Moritz Hardt
Princeton University
Ishay Haviv
Tel Aviv University
Anup Rao§
Institute for Advanced Study
Oded Regev¶
Tel Aviv University
David Steurer
Princeton University
Abstract
We show a connection between the semidefinite relax-
ation of unique games and their behavior under parallel
repetition. Specifically, denoting by val(G) the value of a
two-prover unique game G, and by sdpval(G) the value of
a natural semidefinite program to approximate val(G), we
prove that for every N, if sdpval(G) 1 - , then

Source: Anderson, Richard - Department of Computer Science and Engineering, University of Washington at Seattle

Collections: Computer Technologies and Information Sciences