Parallel Repetition For All 3-Player Games Over Binary Alphabet
We prove that for every 3-player game with binary questions and answers and value $0$, such that the value of the $n$-fold parallel repetition of the game is at most $n^{-c}$. Along the way to proving this theorem, we prove two additional parallel repetition theorems for multiplayer games, that may...
Gespeichert in:
Hauptverfasser: | , , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We prove that for every 3-player game with binary questions and answers and
value $0$, such that the value of the $n$-fold parallel repetition of the game is
at most $n^{-c}$. Along the way to proving this theorem, we prove two
additional parallel repetition theorems for multiplayer games, that may be of
independent interest:
Playerwise Connected Games (with any number of players and any Alphabet
size): We identify a large class of multiplayer games and prove that for every
game with value $ |
---|---|
DOI: | 10.48550/arxiv.2202.06826 |