The parallel repetition of non-signaling games: counterexamples and dichotomy

DOI10.1145/3313276.3316367MaRDI QIDQ5212759zbMATH OpenOpenAlexFDO

Authors Justin Holmgren, Lisa Yang

Publication date 30 January 2020

Published in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://dl.acm.org/doi/pdf/10.1145/3313276.3316367?download=true

zbMATH Keywords

multi-player gamesparallel repetitionnon-signaling

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Multistage and repeated games (91A20) Algorithmic game theory and complexity (91A68)

Recommendations

• On the parallel repetition of multi-player games: the no-signaling case
• A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model
• Parallel repetition and concentration for (sub-)no-signalling games via a flexible constrained de Finetti reduction
• Parallel repetition: simplification and the no-signaling case
• A \(k\)-provers parallel repetition theorem for a version of no-signaling model

Cited in

(2)

• Parallel repetition and concentration for (sub-)no-signalling games via a flexible constrained de Finetti reduction
• On the parallel repetition of multi-player games: the no-signaling case

This page was built for publication: The parallel repetition of non-signaling games: counterexamples and dichotomy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212759)