Small Value Parallel Repetition for General Games

DOI10.1145/2746539.2746565zbMath1322.91010OpenAlexW2052447582MaRDI QIDQ2941523

Ankit Garg, Mark Braverman

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

information theoryhardness amplificationparallel repetition

Mathematics Subject Classification ID

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

Related Items

Quantum hedging in two-round prover-verifier interactions ⋮ Interactive Information Complexity ⋮ Low-degree test with polynomially small error ⋮ The work of Mark Braverman ⋮ Communication and information complexity ⋮ Information value of two-prover games ⋮ Information complexity and applications. ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• Graphs

Cites Work

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