Information value of two-prover games

DOI10.4230/LIPIcs.ITCS.2018.12zbMath1462.68055OpenAlexW2782917583MaRDI QIDQ4993275

Young Kun-Ko, Mark Braverman

Publication date: 15 June 2021

Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2018/8346/

zbMATH Keywords

parallel repetitionamortized value of a gameodd-cycle gametwo-prover game

Mathematics Subject Classification ID

Applications of game theory (91A80) Communication complexity, information complexity (68Q11)

Related Items (1)

Dimension Reduction for Polynomials over Gaussian Space and Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect parallel repetition theorem for quantum XOR proof systems
• A parallel repetition theorem for entangled projection games
• Small Value Parallel Repetition for General Games
• A Counterexample to Strong Parallel Repetition
• Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications
• Improved Rounding for Parallel Repeated Unique Games
• Strong Parallel Repetition Theorem for Free Projection Games
• A Parallel Repetition Theorem
• A parallel repetition theorem for all entangled games
• Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost
• Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs
• Analytical approach to parallel repetition
• Parallel repetition of entangled games
• Information Equals Amortized Communication

This page was built for publication: Information value of two-prover games