Parallel Repetition From Fortification
The Parallel Repetition Theorem upper-bounds the value of a repeated (tensored) two prover game in terms of the value of the base game and the number of repetitions. In this work we give a simple transformation on games – “fortification” – and show that for fortified games, the value of the repeated...
Main Author: | Moshkovitz Aaronson, Dana Hadar |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2014
|
Online Access: | http://hdl.handle.net/1721.1/88557 https://orcid.org/0000-0002-5157-8086 |
Similar Items
-
Parallel repetition of multi-party and quantum games via anchoring and fortification
by: Bavarian, Mohammad
Published: (2018) -
The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover
by: Moshkovitz Aaronson, Dana Hadar
Published: (2014) -
Improved Approximation Algorithms for Projection Games
by: Manurangsi, Pasin, et al.
Published: (2014) -
NP-Hardness of Approximately Solving Linear Equations Over Reals
by: Khot, Subhash, et al.
Published: (2011) -
Improved Approximation Algorithms for Projection Games
by: Manurangsi, Pasin, et al.
Published: (2017)