Parallel repetition: simplifications and the no-signaling case

: Consider a game where a referee chooses (x,y) according to a publicly known distribution, sends x to Alice, and y to Bob. Without communicating with each other, Alice responds with a value a and Bob responds with a value b. Alice and Bob jointly win if a publicly known predicate Q(x,y,a,b) is satisfied. Assume that the maximum probability that Alice and Bob can win in such a game

• Type: Conference
• Year: 2007
• Where: STOC
• Authors: Thomas Holenstein
• Keywords: Algorithms, Alice Responds, Bob Responds, STOC 2007