Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published March 18, 2016 | Submitted
Report Open

Anchoring games for parallel repetition

Abstract

Two major open problems regarding the parallel repetition of games are whether an analogue of Raz's parallel-repetition theorem holds for (a) games with more than two players, and (b) games with quantum players using entanglement. We make progress on both problems: we introduce a class of games we call anchored, and prove exponential-decay parallel repetition theorems for anchored games in the multiplayer and entangled-player settings. We introduce a simple transformation on games called anchoring and show that this transformation turns any game into an anchored game. Together, our parallel repetition theorem and our anchoring transformation provide a simple and efficient hardness-amplification technique in both the classical multiplayer and quantum settings.

Additional Information

We thank Mark Braverman and Ankit Garg for useful discussions. MB was supported by NSF under CCF-0939370 and CCF-1420956. HY was supported by Simons Foundation grant #360893, and National Science Foundation Grants 1122374 and 1218547.

Attached Files

Submitted - 1509.07466.pdf

Files

1509.07466.pdf
Files (341.9 kB)
Name Size Download all
md5:1cb6a75f6c6d8e7d65085692ec894ec4
341.9 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
October 18, 2023