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

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… CONTINUE READING

Topics

Statistics

020406080'03'05'07'09'11'13'15'17
Citations per Year

808 Citations

Semantic Scholar estimates that this publication has 808 citations based on the available data.

See our FAQ for additional information.