Papers
Topics
Authors
Recent
Search
2000 character limit reached

Products of synchronous games

Published 24 Sep 2021 in math.OA | (2109.12039v1)

Abstract: We show that the -algebra of the product of two synchronous games is the tensor product of the corresponding *-algebras. We prove that the product game has a perfect C-strategy if and only if each of the individual games does, and that in this case the C*-algebra of the product game is -isomorphic to the maximal C-tensor product of the individual C*-algebras. We provide examples of synchronous games whose synchronous values are strictly supermultiplicative.

Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.