Sciweavers

8 search results - page 2 / 2
» Parallel Repetition in Projection Games and a Concentration ...
Sort
View
67
Voted
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
14 years 11 months ago
Improved Rounding for Parallel Repeated Unique Games
We show a tight relation between the behavior of unique games under parallel repetition and their semidefinite value. Let G be a unique game with alphabet size k. Suppose the semid...
David Steurer
99
Voted
STOC
2009
ACM
150views Algorithms» more  STOC 2009»
15 years 11 months ago
Integrality gaps for Sherali-Adams relaxations
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...
Moses Charikar, Konstantin Makarychev, Yury Makary...
82
Voted
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
15 years 2 months ago
A Cryptographic Solution to a Game Theoretic Problem
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...
Yevgeniy Dodis, Shai Halevi, Tal Rabin