DeepAI AI Chat
Log In Sign Up

Strong Parallel Repetition for Unique Games on Small Set Expanders

by   Dana Moshkovitz, et al.
The University of Texas at Austin

Strong Parallel Repetition for Unique Games on Small Set Expanders The strong parallel repetition problem for unique games is to efficiently reduce the 1-delta vs. 1-C*delta gap problem of Boolean unique games (where C>1 is a sufficiently large constant) to the 1-epsilon vs. epsilon gap problem of unique games over large alphabet. Due to its importance to the Unique Games Conjecture, this problem garnered a great deal of interest from the research community. There are positive results for certain easy unique games (e.g., unique games on expanders), and an impossibility result for hard unique games. In this paper we show how to bypass the impossibility result by enlarging the alphabet sufficiently before repetition. We consider the case of unique games on small set expanders for two setups: (i) Strong small set expanders that yield easy unique games. (ii) Weaker small set expanders underlying possibly hard unique games as long as the game is mildly fortified. We show how to fortify unique games in both cases, i.e., how to transform the game so sufficiently large induced sub-games have bounded value. We then prove strong parallel repetition for the fortified games. Prior to this work fortification was known for projection games but seemed hopeless for unique games.


page 1

page 2

page 3

page 4


Reduction From Non-Unique Games To Boolean Unique Games

We reduce the problem of proving a "Boolean Unique Games Conjecture" (wi...

Statistical physics approaches to Unique Games

We show how two techniques from statistical physics can be adapted to so...

A Periodic Isoperimetric Problem Related to the Unique Games Conjecture

We prove the endpoint case of a conjecture of Khot and Moshkovitz relate...

Solving Unique Games over Globally Hypercontractive Graphs

We study the complexity of affine Unique-Games (UG) over globally hyperc...

Computational topology and the Unique Games Conjecture

Covering spaces of graphs have long been useful for studying expanders (...

Inapproximability of Unique Games in Fixed-Point Logic with Counting

We study the extent to which it is possible to approximate the optimal v...

Block Rigidity: Strong Multiplayer Parallel Repetition implies Super-Linear Lower Bounds for Turing Machines

We prove that a sufficiently strong parallel repetition theorem for a sp...