# On the power of unique 2-prover 1-round games

@inproceedings{Khot2002OnTP, title={On the power of unique 2-prover 1-round games}, author={Subhash Khot}, booktitle={STOC '02}, year={2002} }

A 2-prover game is called unique if the answer of one prover uniquely determines the answer of the second prover and vice versa (we implicitly assume games to be one round games). The value of a 2-prover game is the maximum acceptance probability of the verifier over all the prover strategies. We make the following conjecture regarding the power of unique 2-prover games, which we call the Unique Games Conjecture:(MATH) The Unique Games Conjecture: For arbitrarily small constants $ \ \zeta… Expand

#### Topics from this paper

#### 474 Citations

Unique Games with Entangled Provers are Easy

- Mathematics, Physics
- 2008 49th Annual IEEE Symposium on Foundations of Computer Science
- 2008

NP-Hardness of Approximately Solving Linear Equations over Reals

- Mathematics, Computer Science
- SIAM J. Comput.
- 2013

#### References

Clique is hard to approximate within n/sup 1-/spl epsiv//

- Mathematics, Computer Science
- Proceedings of 37th Conference on Foundations of Computer Science
- 1996