Non-Signaling Parallel Repetition Using de Finetti Reductions


In the context of multiplayer games, the parallel repetition problem can be phrased as follows: given a game G with optimal winning probability 1 - &#x03B1; and its repeated version G<sup>n</sup> (in which n games are played together, in parallel), can the players use strategies that are substantially better than ones in which each game is played… (More)
DOI: 10.1109/TIT.2016.2516022


2 Figures and Tables