How to play unique games using embeddings

Eden Chlamtac, Konstantin Makarychev, Yury Makarychev

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

41 Scopus citations

Abstract

In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 - ε) fraction of all constraints is satisfiable, the algorithm finds an assignment satisfying a 1 - O(ε√ log n log k) fraction of all constraints. To this end, we introduce new embedding techniques for rounding semidefinite relaxations of problems with large domain size.

Original languageEnglish
Title of host publication47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006
Pages687-696
Number of pages10
DOIs
StatePublished - 1 Dec 2006
Externally publishedYes
Event47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006 - Berkeley, CA, United States
Duration: 21 Oct 200624 Oct 2006

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
ISSN (Print)0272-5428

Conference

Conference47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006
Country/TerritoryUnited States
CityBerkeley, CA
Period21/10/0624/10/06

Fingerprint

Dive into the research topics of 'How to play unique games using embeddings'. Together they form a unique fingerprint.

Cite this