Related papers: Generalized parity-oblivious communication games p…
This paper explores a PAC (probably approximately correct) learning model in cooperative games. Specifically, we are given $m$ random samples of coalitions and their values, taken from some unknown cooperative game; can we predict the…
We introduce quantum XOR games, a model of two-player one-round games that extends the model of XOR games by allowing the referee's questions to the players to be quantum states. We give examples showing that quantum XOR games exhibit a…
Alice and Bob take turns (with Alice playing first) in declaring numbers from the set $[1,2N]$. If a player declares a number that was previously declared, that player looses and the other player wins. If all numbers are declared without…
We pursue the possible connections between classical games and quantum computation. The Parrondo game is one in which a random combination of two losing games produces a winning game. We introduce novel realizations of this Parrondo effect…
Opacity is a general language-theoretic framework in which several security properties of a system can be expressed. Its parameters are a predicate, given as a subset of runs of the system, and an observation function, from the set of runs…
This paper reframes approachability theory within the context of population games. Thus, whilst one player aims at driving her average payoff to a predefined set, her opponent is not malevolent but rather extracted randomly from a…
An (n,m,p) Random Access Code (RAC) allows to encode n bits in an m bit message, in such a way that a receiver of the message can guess any of the original $n$ bits with probability p, greater than 1/2. In Quantum RAC's (QRACs) one…
We consider a wireless communication system in which $N$ transmitter-receiver pairs want to communicate with each other. Each transmitter transmits data at a certain rate using a power that depends on the channel gain to its receiver. If a…
Persuasion, defined as the act of exploiting an informational advantage in order to effect the decisions of others, is ubiquitous. Indeed, persuasive communication has been estimated to account for almost a third of all economic activity in…
Coding theory revolves around the incorporation of redundancy into transmitted symbols, computation tasks, and stored data to guard against adversarial manipulation. However, error correction in coding theory is contingent upon a strict…
Random access code (RAC), a primitive for many information processing protocols, enables one party to encode n-bit string into one bit of message such that another party can retrieve partial information of that string. We introduce the…
We present a quantum auction protocol using superpositions to represent bids and distributed search to identify the winner(s). Measuring the final quantum state gives the auction outcome while simultaneously destroying the superposition.…
We consider two-player partial-observation stochastic games on finite-state graphs where player 1 has partial observation and player 2 has perfect observation. The winning condition we study are \omega-regular conditions specified as parity…
Although `quantum contextuality' is one of the most fundamental non-classical feature, its generic role in information processing and computation is an open quest. In this article, we present a family of distributed computing tasks…
In higher-order quantum computing (HOQC), one typically considers the universal transformation of unknown quantum operations, treated as blackboxes. It is also implicitly assumed that the resulting operation must act on arbitrary, and thus…
We introduce a quantum cloning game in which $k$ separate collaborative parties receive a classical input, determining which of them has to share a maximally entangled state with an additional party (referee). We provide the optimal winning…
Alice communicates with words drawn uniformly amongst $\{\ket{j}\}_{j=1..n}$, the canonical orthonormal basis. Sometimes however Alice interleaves quantum decoys $\{\frac{\ket{j}+i\ket{k}}{\sqrt{2}}\}$ between her messages. Such pairwise…
Algorithms for oblivious random access machine (ORAM) simulation allow a client, Alice, to obfuscate a pattern of data accesses with a server, Bob, who is maintaining Alice's outsourced data while trying to learn information about her data.…
Suppose two distant observers Alice and Bob share a pure biparticle entangled state secretly chosen from a set, it is shown that Alice (Bob) can probabilistic concentrate the state to a maximally entangled state by applying local operations…
It is well known that reinforcement learning can be cast as inference in an appropriate probabilistic model. However, this commonly involves introducing a distribution over agent trajectories with probabilities proportional to exponentiated…