A k-provers parallel repetition theorem for a version of no-signaling model

DOI10.1142/S1793830910000802MaRDI QIDQ3084679zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model
• On the parallel repetition of multi-player games: the no-signaling case
• A Parallel Repetition Theorem
• Error reduction by parallel repetition - a negative result
• Parallel repetition: simplification and the no-signaling case

Cites work

• A Parallel Repetition Theorem
• Elements of Information Theory
• Error reduction by parallel repetition - a negative result
• Proposed experiment to test local hidden-variable theories

Cited in

(6)

• Perfect parallel repetition theorem for quantum XOR proof systems
• A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
• Polynomial-Space Approximation of No-Signaling Provers
• On the parallel repetition of multi-player games: the no-signaling case
• A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model
• The parallel repetition of non-signaling games: counterexamples and dichotomy

This page was built for publication: A \(k\)-provers parallel repetition theorem for a version of no-signaling model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084679)