DocumentCode
1632560
Title
On the power of unique 2-prover 1-round games
Author
Khot, Subhash
Author_Institution
Princeton Univ., NJ, USA
fYear
2002
fDate
6/24/1905 12:00:00 AM
Firstpage
15
Lastpage
15
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 (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 a conjecture regarding the power of unique 2-prover games, which we call the Unique Games Conjecture
Keywords
computational complexity; constraint theory; game theory; graph theory; NP-hard; Unique Games Conjecture; constraint satisfaction problem; graph; maximum acceptance probability; unique 2-prover 1-round games; unique two-prover one-round games; Chromium; Computational complexity; Equations;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Complexity, 2002. Proceedings. 17th IEEE Annual Conference on
Conference_Location
Montreal, Que.
ISSN
1093-0159
Print_ISBN
0-7695-1468-5
Type
conf
DOI
10.1109/CCC.2002.1004334
Filename
1004334
Link To Document