Related papers: Certified randomness between mistrustful players
We provide an interesting two-party parity oblivious communication game whose success probability is solely determined by the Bell expression. The parity-oblivious condition in an operational quantum theory implies the preparation…
Using the game-theoretic framework for probability, Vovk and Shafer. have shown that it is always possible, using randomization, to make sequential probability forecasts that pass any countable set of well-behaved statistical tests. This…
In this paper, we study the notion of admissibility for randomised strategies in concurrent games. Intuitively, an admissible strategy is one where the player plays `as well as possible', because there is no other strategy that dominates…
J. Beck has shown that if two players alternately select previously unchosen points from the plane, Player 1 can always build a congruent copy of any given finite goal set G, in spite of Player 2's efforts to stop him. We give a finite goal…
We present a multipartite nonlocal game in which each player must guess the input received by his neighbour. We show that quantum correlations do not perform better than classical ones at this game, for any prior distribution of the inputs.…
Prediction markets provide an efficient means to assess uncertain quantities from forecasters. Traditional and competitive strictly proper scoring rules have been shown to incentivize players to provide truthful probabilistic forecasts.…
In a recently introduced coset guessing game, Alice plays against Bob and Charlie, aiming to meet a joint winning condition. Bob and Charlie can only communicate before the game starts to devise a joint strategy. The game we consider begins…
The Greenberger-Horne-Zeilinger (GHZ) paradox, involving quantum systems with three or more subsystems, offers an 'all-vs-nothing' test of quantum nonlocality. Unlike Bell tests for bipartite systems, which reveal statistical…
"Guess Who?" is a popular two player game where players ask "Yes"/"No" questions to search for their opponent's secret identity from a pool of possible candidates. This is modeled as a simple stochastic game. Using this model, the optimal…
We investigate the possibility of "having someone carry out the work of executing a function for you, but without letting him learn anything about your input". Say Alice wants Bob to compute some known function f upon her input x, but wants…
The non-local correlations exhibited when measuring entangled particles can be used to certify the presence of genuine randomness in Bell experiments. While non-locality is necessary for randomness certification, it is unclear when and why…
The domatic number of a graph is the maximum number of pairwise disjoint dominating sets admitted by the graph. We introduce a game based around this graph invariant. The domatic number game is played on a graph $G$ by two players, Alice…
We introduce a three-player nonlocal game, with a finite number of classical questions and answers, such that the optimal success probability of $1$ in the game can only be achieved in the limit of strategies using arbitrarily…
Oblivious transfer is a fundamental cryptographic primitive in which Bob transfers one of two bits to Alice in such a way that Bob cannot know which of the two bits Alice has learned. We present an optimal security bound for quantum…
We give a (remote) quantum gambling scheme that makes use of the fact that quantum nonorthogonal states cannot be distinguished with certainty. In the proposed scheme, two participants Alice and Bob can be regarded as playing a game of…
Automated verification techniques for stochastic games allow formal reasoning about systems that feature competitive or collaborative behaviour among rational agents in uncertain or probabilistic settings. Existing tools and techniques…
We consider mechanisms for truthfully eliciting probabilistic predictions from a group of experts. The standard approach -- using a proper scoring rule to separately reward each expert -- is not robust to collusion: experts may collude to…
In the synthesis of distributed systems, we automate the development of distributed programs and hardware by automatically deriving correct implementations from formal specifications. For synchronous distributed systems, the synthesis…
Quantum randomness can be certified from probabilistic behaviors demonstrating Bell nonlocality or Einstein-Podolsky-Rosen steering, leveraging outcomes from uncharacterized devices. However, such nonlocal correlations are not always…
A scoring rule is a function of a probabilistic forecast and a corresponding outcome that is used to evaluate forecast performance. A wide range of scoring rules have been defined over time and there is some debate as to which are the most…