Small value parallel repetition for general games

DOI10.1145/2746539.2746565MaRDI QIDQ2941523zbMATH OpenOpenAlexFDO

Authors Mark Braverman, Ankit Garg

Publication date 21 August 2015

Published in Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2746539.2746565

zbMATH Keywords

hardness amplificationinformation theoryparallel repetition

Mathematics Subject Classification ID

Multistage and repeated games (91A20) Information theory (general) (94A15)

Recommendations

• Strong Parallel Repetition Theorem for Free Projection Games
• A counterexample to strong parallel repetition
• Parallel repetition of two-prover one-round games: an exposition
• Parallel repetition in projection games and a concentration bound
• Analytical approach to parallel repetition

Cites work

• Approximate distance oracles
• Approximate distance oracles with constant query time
• Automata, Languages and Programming
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Fast C-K-R partitions of sparse graphs
• Near-Linear Time Construction of Sparse Neighborhood Covers
• On approximate distance labels and routing schemes with affine stretch
• On sparse spanners of weighted graphs
• Ramsey partitions and proximity data structures
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• Shortest-path queries in static networks

Cited in

(14)

• Information complexity and applications.
• Low-degree test with polynomially small error
• Interactive information complexity
• Quantum hedging in two-round prover-verifier interactions
• Parallel repetition via fortification: analytic view and the quantum case
• Multiplayer parallel repetition for expanding games
• Information value of two-prover games
• Optimal strong parallel repetition for projection games on low threshold rank graphs
• Analytical approach to parallel repetition
• The work of Mark Braverman
• Communication and information complexity
• Parallel repetition of k-player projection games
• Block rigidity: strong multiplayer parallel repetition implies super-linear lower bounds for Turing machines
• Parallel repetition for the \textsf{GHZ} game: exponential decay

Describes a project that uses

Uses Software

• Graphs

This page was built for publication: Small value parallel repetition for general games

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