Abstract
A 2-prover game is called unique if the answer of one prover uniquely determines the answer of the second prover and vice versa. The value of a 2-prover game is the maximum acceptance probability of the verifier over all the prover strategies. Thus, the following conjecture regarding the power of unique 2-prover games, which is called the Unique Games Conjecture is made.
| Original language | English (US) |
|---|---|
| Title of host publication | Conference Proceedings of the Annual ACM Symposium on Theory of Computing |
| Pages | 767-775 |
| Number of pages | 9 |
| State | Published - 2002 |
| Event | Proceedings of the 34th Annual ACM Symposium on Theory of Computing - Montreal, Que., Canada Duration: May 19 2002 → May 21 2002 |
Other
| Other | Proceedings of the 34th Annual ACM Symposium on Theory of Computing |
|---|---|
| Country/Territory | Canada |
| City | Montreal, Que. |
| Period | 5/19/02 → 5/21/02 |
ASJC Scopus subject areas
- Software