# How to Play Unique Games Against a Semi-Random Adversary

• Makarychev, K (IBM Research)
• Tuesday 24 May 2011, 14:00-15:00
• Seminar Room 1, Newton Institute.

If you have a question about this talk, please contact Mustapha Amrani.

Discrete Analysis

We study the average case complexity of the Unique Games problem. We propose a semi-random model, in which a unique game instance is generated in several steps. First an adversary selects a completely satisfiable instance of Unique Games, then she chooses an epsilon-fraction of all edges, and finally replaces (“corrupts’‘) the constraints corresponding to these edges with new constraints. If all steps are adversarial, the adversary can obtain any (1-epsilon)-satisfiable instance, so then the problem is as hard as in the worst case. We show however that we can find a solution satisfying a (1-delta)-fraction of all constraints in polynomial-time if at least one step is random (we require that the average degree of the graph is at least log k). Our result holds only for epsilon less than some absolute constant. We prove that if epsilon 1/2, then the problem is hard, that is, no polynomial-time algorithm can distinguish between the following two cases: (i) the instance is a (1-epsilon) satisfiable semi-random instance and (ii) the instance is at most delta satisfiable (for every delta > 0); the result assumes the 2-to-2 Unique Games conjecture.

Finally, we study semi-random instances of Unique Games that are at most (1-epsilon) satisfiable. We present an algorithm that distinguishes between the case when the instance is a semi-random instance and the case when the instance is an arbitrary (1-delta)-satisfiable instance (if epsilon > c delta, for some absolute constant c).

``Joint work with Alexandra Kolla and Yury Makarychev``

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

## This talk is included in these lists:

Note that ex-directory lists are not shown.

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity