Related papers: Strong Quantum Solutions in Conflicting Interest B…
We characterize exact, and approximate, optimality of games that players can interact with using quantum strategies. In comparison to a previous work of the author, arXiv: 2311.12887, which applied a 2016 framework due to Ostrev for…
This paper studies sequential quantum games under the assumption that the moves of the players are drawn from groups and not just plain sets. The extra group structure makes possible to easily derive some very general results characterizing…
A Bayesian game is a game of incomplete information in which the rules of the game are not fully known to all players. We consider the Bayesian game of Battle of Sexes that has several Bayesian Nash equilibria and investigate its outcome…
We consider the problem of a particular kind of quantum correlation that arises in some two-party games. In these games, one player is presented with a question they must answer, yielding an outcome of either 'win' or 'lose'. Molina and…
After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information. In…
Quantum resources can be more powerful than classical resources - a quantum computer can solve certain problems exponentially faster than a classical computer, and computing a function of two people's inputs can be done with exponentially…
We present a systematic investigation of the quantum games, constructed using a novel repeated game protocol, when played repeatedly ad infinitum. We focus on establishing that such repeated games -- by virtue of inherent quantum-mechanical…
We define generalized quantum games by introducing the coherent payoff operators and propose a simple scheme to illustrate it. The scheme is implemented with a single spin qubit system and two entangled qubit system. The Nash Equilibrium…
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…
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…
Whether uniquely quantum resources confer advantages in fully classical, competitive environments remains an open question. Competitive zero-sum reinforcement learning is particularly challenging, as success requires modelling dynamic…
Quantum computers that process information by harnessing the remarkable power of quantum mechanics are increasingly being put to practical use. In the future, their impact will be felt in numerous fields, including in online casino games.…
Witnessing quantum correlation in real, practical experimental set-ups is a key focus for the development of near-future quantum technologies. Whilst there are several experimental protocols for witnessing entanglement, detecting quantum…
We introduce a new paradigm for game theory -- Bayesian satisfaction. This novel approach is a synthesis of the idea of Bayesian rationality introduced by Aumann, and satisfaction games. The concept of Bayesian rationality for which, in…
In a recent paper, Junge and Palazuelos presented two two-player games exhibiting interesting properties. In their first game, entangled players can perform notably better than classical players. The quantitative gap between the two cases…
In classical problem solving, there is of course correlation between the selection of the problem on the part of Bob (the problem setter) and that of the solution on the part of Alice (the problem solver). In quantum problem solving, this…
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…
It is by now well-established that there exist non-local games for which the best entanglement-assisted performance is not better than the best classical performance. Here we show in contrast that any two-player XOR game, for which the…
Games with incomplete information are formulated in a multi-sector probability matrix formalism that can cope with quantum as well as classical strategies. An analysis of classical and quantum strategy in a multi-sector extension of the…
We investigate the 3-player quantum Prisoner's Dilemma with a certain strategic space, a particular Nash equilibrium that can remove the original dilemma is found. Based on this equilibrium, we show that the game is enhanced by the…