Perfect strategies for non-signalling games
M. Lupini, L. Mancinska, V. I. Paulsen, D. E. Roberson, G. Scarpa, S., Severini, I. G. Todorov, A. Winter

TL;DR
This paper unifies and extends results on non-signalling games by introducing new game families, characterizing perfect strategies via C*-algebras, and exploring algebraic and quantum properties of these games.
Contribution
It introduces reflexive, imitation, and mirror games, and characterizes perfect strategies using C*-algebraic methods, extending known results in non-local game theory.
Findings
Characterization of perfect strategies via C*-algebras.
Introduction of new game families: reflexive, imitation, and mirror games.
Connection between approximate quantum strategies and amenable traces.
Abstract
We unify and consolidate various results about non-signall-ing games, a subclass of non-local two-player one-round games, by introducing and studying several new families of games and establishing general theorems about them, which extend a number of known facts in a variety of special cases. Among these families are {\it reflexive games,} which are characterised as the hardest non-signalling games that can be won using a given set of strategies. We introduce {\it imitation games,} in which the players display linked behaviour, and which contains as subclasses the classes of variable assignment games, binary constraint system games, synchronous games, many games based on graphs, and {\it unique} games. We associate a C*-algebra to any imitation game , and show that the existence of perfect quantum commuting (resp.\ quantum, local) strategies of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
