8 search results - page 2 / 2 » Rounding Parallel Repetitions of Unique Games |
COCOON
2010
Springer
13 years 10 months ago
2010
Springer
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
CRYPTO
2000
Springer
13 years 10 months ago
2000
Springer
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...