Related papers: Parallel repetition: simplifications and the no-si…
We propose an entanglement sharing protocol based on separable states. Initially, two parties, Alice and Bob, share a two-mode separable Gaussian state. Alice then splits her mode into two separable modes and distributes them between two…
Probabilistic concurrent/distributed strategies have so far not been investigated thoroughly in the context of imperfect information, where the Player has only partial knowledge of the moves made by the Opponent. In a situation where the…
We consider a game with two piles, in which two players take turn to add $a$ or $b$ chips ($a$, $b$ are not necessarily positive) randomly and independently to their respective piles. The player who collects $n$ chips first wins the game.…
Toral (2002) considered an ensemble of N\geq2 players. In game B a player is randomly selected to play Parrondo's original capital-dependent game. In game A' two players are randomly selected without replacement, and the first transfers one…
We study a game where one player selects a random function, and the other has to guess that function, and show that with high probability the second player can correctly guess most of the random function. We apply this analysis to…
Quantum entanglement has been recently demonstrated as a useful resource in conflicting interest games of incomplete information between two players, Alice and Bob [Pappa et al., Phys. Rev. Lett. 114, 020401 (2015)]. General setting for…
We prove that for any 3-player game $\mathcal G$, whose query distribution has the same support as the GHZ game (i.e., all $x,y,z\in \{0,1\}$ satisfying $x+y+z=0\pmod{2}$), the value of the $n$-fold parallel repetition of $\mathcal G$…
Given a graph $G$ and $k \in \mathbb{N}$, we introduce the following game played in $G$. Each round, Alice colours an uncoloured vertex of $G$ red, and then Bob colours one blue (if any remain). Once every vertex is coloured, Alice wins if…
The $[X,Y]$-edge colouring game is played with a set of $k$ colours on a graph $G$ with initially uncoloured edges by two players, Alice (A) and Bob (B). The players move alternately. Player $X\in\{A,B\}$ has the first move.…
We consider a two-player search game on a tree $T$. One vertex (unknown to the players) is randomly selected as the target. The players alternately guess vertices. If a guess $v$ is not the target, then both players are informed in which…
We analyse the common information problem for the generalised Gray-Wyner problem. We aim to explore the problem and solution in relation to the non-orthogonality among the source decoders' components. We consider a simple networked control…
Two topics are presented: synchronization games and synchronization costs. In a synchronization game on a deterministic finite automaton, there are two players, Alice and Bob, whose moves alternate. Alice wants to synchronize the given…
We study a distributed estimation problem in which two remotely located parties, Alice and Bob, observe an unlimited number of i.i.d. samples corresponding to two different parts of a random vector. Alice can send $k$ bits on average to…
Three different quantum cards which are non-orthogonal quantum bits are sent to two different players, Alice and Bob, randomly. Alice receives one of the three cards, and Bob receives the remaining two cards. We find that Bob could know…
We investigate sharing of bipartite entanglement in a scenario where half of an entangled pair is possessed and projectively measured by one observer, called Alice, while the other half is subjected to measurements performed sequentially,…
Behavioural equivalences can be characterized via bisimulation, modal logics, and spoiler-duplicator games. In this paper we work in the general setting of coalgebra and focus on generic algorithms for computing the winning strategies of…
The stochastic multi-armed bandit model captures the tradeoff between exploration and exploitation. We study the effects of competition and cooperation on this tradeoff. Suppose there are $k$ arms and two players, Alice and Bob. In every…
Assume Alice and Bob share some bipartite $d$-dimensional quantum state. A well-known result in quantum mechanics says that by performing two-outcome measurements, Alice and Bob can produce correlations that cannot be obtained locally,…
Motivated by its relation to the length of cutting plane proofs for the Maximum Biclique problem, we consider the following communication game on a given graph G, known to both players. Let K be the maximal number of vertices in a complete…
We show equivalences between several high-dimensional problems in extremal combinatorics and parallel repetition of multiplayer (multiprover) games over large answer alphabets. This extends the forbidden-subgraph technique, previously…