Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 406

The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.

Analytical approach to parallel repetition

Dinur, Irit, Steurer, David·2014·Proceedings of the forty-sixth annual ACM symposium on Theory of computing
DOI 10.1145/2591796.2591884
Open this paper in CoChat — free account

Abstract

We propose an analytical framework for studying parallel repetition, a basic product operation for one-round twoplayer games. In this framework, we consider a relaxation of the value of projection games. We show that this relaxation is multiplicative with respect to parallel repetition and that it provides a good approximation to the game value. Based on this relaxation, we prove the following improved parallel repetition bound: For every projection game G with value at most ρ, the k-fold parallel repetition G⊗k has value at most

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2591796.2591884

Cites

11 of 11 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 11 references

Cited by

See all 406

Metadata

Authors
Dinur, I., & Steurer, D.
Venue
Proceedings of the forty-sixth annual ACM symposium on Theory of computing
Publisher
ACM
Published
2014-05-31
Pages
624-633
DOI
10.1145/2591796.2591884
OpenAlex
W2044471216
Cited by
406
References
11
FWCI
53.49
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Analytical approach to parallel repetition. https://app.cochat.ai/papers/10.1145/2591796.2591884
The paper
Dinur, I., & Steurer, D. (2014). Analytical approach to parallel repetition. Proceedings of the forty-sixth annual ACM symposium on Theory of computing. https://doi.org/10.1145/2591796.2591884

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.