Related papers: Linear game non-contextuality and Bell inequalitie…

A two-player one-round binary game consists of two cooperative players who each replies by one bit to a message that he receives privately; they win the game if both questions and answers satisfy some predetermined property. A game is…

The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…

We analyze the difference between ex ante and ex post equilibria in classical games played with the assistance of a nonlocal (quantum or no-signaling) resource. In physics, the playing of these games is known as performing bipartite…

We investigate the relation between Bell inequalities and nonlocal games by presenting a systematic method for their bilateral conversion. In particular, we show that while to any nonlocal game there naturally corresponds a unique Bell…

Non-locality is a feature of quantum mechanics that cannot be explained by local realistic theory. It can be detected by the violation of Bell's inequality. In this work, we have considered the evaluation of Bell's inequality with the help…

A quantum game in the Eisert scheme is defined by the payoff matrix, plus some quantum entanglement parameters. In the symmetric nonzero-sum 2x2 games, the relevant features of the game are given by two parameters in the payoff matrix, and…

We initiate a study of random instances of nonlocal games. We show that quantum strategies are better than classical for almost any 2-player XOR game. More precisely, for large n, the entangled value of a random 2-player XOR game with n…

We investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters…

The UNIQUE GAMES problem is a central problem in algorithms and complexity theory. Given an instance of UNIQUE GAMES, the STRONG UNIQUE GAMES problem asks to find the largest subset of vertices, such that the UNIQUE GAMES instance induced…

We study bipartite correlations in Bell-type games. We show that in a setup where the information carriers are allowed to locally deform the manifold on which the game is played, stronger correlations may be obtained than those maximally…

We develop a resource-theoretical approach that allows us to quantify values of two-player, one-round cooperative games with quantum inputs and outputs, as well as values of quantum probabilistic hypergraphs. We analyse the quantum game…

Graph games provide the foundation for modeling and synthesis of reactive processes. Such games are played over graphs where the vertices are controlled by two adversarial players. We consider graph games where the objective of the first…

This paper studies the rationalization and identification of binary games where players have correlated private types. Allowing for correlation is crucial in global games and in models with social interactions as it represents correlated…

Nonlocal games play a crucial role in quantum information theory and have numerous applications in certification and cryptographic protocols. Kalai et al. (STOC 2023) introduced a procedure to compile a nonlocal game into a single-prover…

Nonlocal games provide application-level benchmarks for quantum hardware whose classical performance bounds are information-theoretic, holding against all classical strategies regardless of computational resources. We implement a 14-vertex…

In this work, we study a particular class of Bell inequalities involving only direct equality-comparisons of outcomes. This arises naturally when outcomes are difficult to characterize. For instance, if measurements yield smells, it may be…

Parity games are games that are played on directed graphs whose vertices are labeled by natural numbers, called priorities. The players push a token along the edges of the digraph. The winner is determined by the parity of the greatest…

We introduce a two-player nonlocal game, called the $(G,H)$-isomorphism game, where classical players can win with certainty if and only if the graphs $G$ and $H$ are isomorphic. We then define the notions of quantum and non-signalling…

We show that for any $\varepsilon>0$ there is an XOR game $G=G(\varepsilon)$ with $\Theta(\varepsilon^{-1/5})$ inputs for one player and $\Theta(\varepsilon^{-2/5})$ inputs for the other player such that $\Omega(\varepsilon^{-1/5})$ ebits…

We consider quantum XOR games, defined in [11], from the perspective of unitary correlations defined in [7]. We show that Connes' embedding problem has a positive answer if and only if every quantum XOR game has entanglement bias equal to…