skip to main content
10.1145/1374376.1374378acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
research-article

Parallel repetition in projection games and a concentration bound

Published: 17 May 2008 Publication History

Abstract

In a two player game, a referee asks two cooperating players (who are not allowed to communicate) questions sampled from some distribution and decides whether they win or not based on some predicate of the questions and their answers. The parallel repetition of the game is the game in which the referee samples n independent pairs of questions and sends corresponding questions to the players simultaneously. The players may now answer each question in a way that depends on the other questions they are asked.
If the players cannot win the original game with probability better than (1-ε), what's the best they can do in the repeated game? We improve earlier results of Raz and Holenstein, which showed that the players cannot win all copies in the repeated game with probability better than (1-ε3)Ω(n/c) (here c is the length of the answers in the game), in the following ways: We prove the bound (1-ε2)Ω(n) as long as the game is a "projection game", the type of game most commonly used in hardness of approximation results. Our bound is independent of the answer length and has a better dependence on ε. By the recent work of Raz, this bound is essentially tight. A consequence of this bound is to the Unique Games Conjecture of Khot. Many tight or almost tight hardness of approximation results have been proved using the Unique Games Conjecture, so it would be very interesting to prove this conjecture. We make progress towards this goal by showing that it suffices to prove the following easier statement: {Unique Games Conjecture} For every δ,ε> 0, there exists an alphabet size M(ε) such that it is NP-hard to distinguish a Unique Game with alphabet size M for which a 1-ε2 fraction of the constraints can be satisfied from one in which a 1-ε1-δ fraction of the constraints can be satisfied. We also prove a concentration bound for parallel repetition (of general games) showing that for any constant 0<δ <ε, the probability that the players win a (1-ε+δ) fraction of the games in the parallel repetition is at most exp(-Ω(δ4 n/c)). An application of this is in testing Bell Inequalities. Our result implies that the parallel repetition of the CHSH game can be used to get an experiment that has a very large classical versus quantum gap.

References

[1]
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45, 1998.
[2]
S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70--122, Jan. 1998.
[3]
P. Austrin. Balanced max 2-sat might not be the hardest. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pages 189--197. ACM, 2007.
[4]
J. Barrett, D. Collins, L. Hardy, A. Kent, and S. Popescu. Quantum nonlocality, bell inequalities and the memory loophole. Physical Review A, 66:042111, 2002.
[5]
J. S. Bell. On the Einstein-Podolsky-Rosen paradox. Physics, 1(3):195--290, 1964.
[6]
M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 113--131, 1988.
[7]
M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Efficient identification schemes using two prover interactive proofs. In Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Proceedings, 1989.
[8]
M. Charikar, K. Makarychev, and Y. Makarychev. Near-optimal algorithms for unique games. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006.
[9]
S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, and D. Sivakumar. On the hardness of approximating multicut and sparsest-cut. Proceedings of the 21th Annual IEEE Conference on Computational Complexity, 15, 2006.
[10]
E. Chlamtac, K. Makarychev, and Y. Makarychev. How to play unique games using embeddings. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006.
[11]
J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt. Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett., 23(15):880--884, Oct 1969.
[12]
I. Dinur, E. Mossel, and O. Regev. Conditional hardness for approximate coloring. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing. ACM, 2006. Symposium on Theory of Computing, pages 189--197. ACM, 2007.
[13]
J. Barrett, D. Collins, L. Hardy, A. Kent, and S. Popescu. Quantum nonlocality, bell inequalities and the memory loophole. Physical Review A, 66:042111, 2002.
[14]
J. S. Bell. On the Einstein-Podolsky-Rosen paradox. Physics, 1(3):195--290, 1964.
[15]
M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 113--131, 1988.
[16]
M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Efficient identification schemes using two prover interactive proofs. In Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Proceedings, 1989.
[17]
M. Charikar, K. Makarychev, and Y. Makarychev. Near-optimal algorithms for unique games. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006.
[18]
S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, and D. Sivakumar. On the hardness of approximating multicut and sparsest-cut. Proceedings of the 21th Annual IEEE Conference on Computational Complexity, 15, 2006.
[19]
E. Chlamtac, K. Makarychev, and Y. Makarychev. How to play unique games using embeddings. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006.
[20]
J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt. Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett., 23(15):880--884, Oct 1969.
[21]
I. Dinur, E. Mossel, and O. Regev. Conditional hardness for approximate coloring. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing. ACM, 2006.
[22]
C. Dwork, U. Feige, J. Kilian, M. Naor, and S. Safra. Low communication 2-prover zero-knowledge proofs for NP. In Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Proceedings, 1992.
[23]
U. Feige, S. Goldwasser, L. Lovasz, S. Safra, and M. Szegedy. Approximating clique is almost NP-complete (preliminary version). In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, 1991.
[24]
U. Feige and L. Lovasz. Two-prover one-round proof systems: their power and their problems. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 733--744, 1992.
[25]
U. Feige and O. Verbitsky. Error reduction by parallel repetition--A negative result. Combinatorica, 22, 2002.
[26]
R. D. Gill. Accardi contra bell (cum mundi): The impossible coupling. IMS LECTURE NOTES-MONOGRAPH SERIES, 42, 2003.
[27]
M. Goemans and D. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42, 1995.
[28]
A. Gupta and K. Talwar. Approximating unique games. In SODA, pages 99--106. ACM Press, 2006.
[29]
T. Holenstein. Parallel repetition: Simplifications and the no-signaling case. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007.
[30]
S. Khot. On the power of unique 2-prover 1-round games. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 767--775, 2002.
[31]
S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for max-cut and other 2-variable CSPs? In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2004.
[32]
S. Khot and O. Regev. Vertex cover might be hard to approximate to within 2-ë. In IEEE Conference on Computational Complexity, page 379. IEEE Computer Society, 2003.
[33]
S. Khot and N. Vishnoi. The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into --1 . In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005.
[34]
D. Lapidot and A. Shamir. A one-round, two-prover, zero-knowledge protocol for NP. Combinatorica, 15, 1995.
[35]
C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 286--293, 1993.
[36]
E. Mossel, R. O'Donnell, and K. Oleszkiewicz. Noise stability of functions with low in.uences invariance and optimality. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 21--30. IEEE Computer Society, 2005.
[37]
I. Parnafes, R. Raz, and A. Wigderson. Direct product results and the GCD problem, in old and new communication models. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 363--372, 1997.
[38]
R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763--803, June 1998.
[39]
R. Raz. A counterexample to strong parallel repetition. Technical Report TR08-018, ECCC: Electronic Colloquium on Computational Complexity, 2008.
[40]
L. Trevisan. Approximation algorithms for unique games. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005.
[41]
O. Verbitsky. Towards the parallel repetition conjecture. In Structure in Complexity Theory Conference, pages 304--307, 1994.

Cited By

View all
  • (2025)Parallelize Single-Site Dynamics up to Dobrushin CriterionJournal of the ACM10.1145/370855872:1(1-33)Online publication date: 25-Jan-2025
  • (2023)Composably secure device-independent encryption with certified deletionQuantum10.22331/q-2023-07-06-10477(1047)Online publication date: 6-Jul-2023
  • (2022)Parallel repetition for all 3-player games over binary alphabetProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520071(998-1009)Online publication date: 9-Jun-2022
  • Show More Cited By

Index Terms

  1. Parallel repetition in projection games and a concentration bound

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computing
    May 2008
    712 pages
    ISBN:9781605580470
    DOI:10.1145/1374376
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 17 May 2008

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. chsh game
    2. parallel repetition
    3. unique games conjecture

    Qualifiers

    • Research-article

    Conference

    STOC '08
    Sponsor:
    STOC '08: Symposium on Theory of Computing
    May 17 - 20, 2008
    British Columbia, Victoria, Canada

    Acceptance Rates

    STOC '08 Paper Acceptance Rate 80 of 325 submissions, 25%;
    Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

    Upcoming Conference

    STOC '25
    57th Annual ACM Symposium on Theory of Computing (STOC 2025)
    June 23 - 27, 2025
    Prague , Czech Republic

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)18
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 18 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2025)Parallelize Single-Site Dynamics up to Dobrushin CriterionJournal of the ACM10.1145/370855872:1(1-33)Online publication date: 25-Jan-2025
    • (2023)Composably secure device-independent encryption with certified deletionQuantum10.22331/q-2023-07-06-10477(1047)Online publication date: 6-Jul-2023
    • (2022)Parallel repetition for all 3-player games over binary alphabetProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520071(998-1009)Online publication date: 9-Jun-2022
    • (2018)Almost polynomial hardness of node-disjoint paths in gridsProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188772(1220-1233)Online publication date: 20-Jun-2018
    • (2018)Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS.2018.00062(592-601)Online publication date: Oct-2018
    • (2015)Information Complexity and the Quest for Interactive CompressionACM SIGACT News10.1145/2789149.278916146:2(41-64)Online publication date: 4-Jun-2015
    • (2015)Small Value Parallel Repetition for General GamesProceedings of the forty-seventh annual ACM symposium on Theory of Computing10.1145/2746539.2746565(335-340)Online publication date: 14-Jun-2015
    • (2015)An Interactive Information Odometer and ApplicationsProceedings of the forty-seventh annual ACM symposium on Theory of Computing10.1145/2746539.2746548(341-350)Online publication date: 14-Jun-2015
    • (2015)A parallel repetition theorem for entangled projection gamesComputational Complexity10.1007/s00037-015-0098-324:2(201-254)Online publication date: 1-Jun-2015
    • (2014)Hardness of finding independent sets in 2-colorable and almost 2-colorable hypergraphsProceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms10.5555/2634074.2634191(1607-1625)Online publication date: 5-Jan-2014
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media