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

Subhash Khot
2002 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02  
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 :
doi:10.1145/510014.510017 fatcat:v6b6shr4hbcb5cga27p2osbtxu