Two-prover one-round proof systems: their power and their problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Two prover protocols: low error at affordable rates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Playing Games of Incomplete Information
STACS '90 Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science
Error Reduction by Parallel Repetition—A Negative Result
Combinatorica
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Parallel repetition: simplifications and the no-signaling case
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Parallel repetition in projection games and a concentration bound
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
The parallel repetition theorem states that for any two provers one round game with value at most 1-ε (for ε 3)Ω(n/ log s) where s is the size of the answers set [Raz98],[Hol07]. It is not known how the value of the game decreases when there are three or more players. In this paper we address the problem of the error decrease of parallel repetition game for k-provers where k 2. We consider a special case of the No-Signaling model and show that the error of the parallel repetition of k provers one round game, for k 2, in this model, decreases exponentially depending only on the error of the original game and on the number of repetitions. There were no prior results for k-provers parallel repetition for k 2 in any model.