A k-PROVERS PARALLEL REPETITION THEOREM FOR A VERSION OF NO-SIGNALING MODEL

DOI10.1142/S1793830910000802zbMath1217.68106OpenAlexW2055098894MaRDI QIDQ3084679

Ricky Rosen

Publication date: 25 March 2011

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830910000802

zbMATH Keywords

complexityparallel repetitionno-signaling model

Mathematics Subject Classification ID

Signaling and communication in game theory (91A28) Multistage and repeated games (91A20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20) Combinatorial probability (60C99)

Cites Work

• Error reduction by parallel repetition - a negative result
• A Parallel Repetition Theorem
• Proposed Experiment to Test Local Hidden-Variable Theories
• Elements of Information Theory

This page was built for publication: A k-PROVERS PARALLEL REPETITION THEOREM FOR A VERSION OF NO-SIGNALING MODEL