Related papers: Two Party Non-Local Games
We consider game theory from the perspective of quantum algorithms. Strategies in classical game theory are either pure (deterministic) or mixed (probabilistic). We introduce these basic ideas in the context of a simple example, closely…
Iterated bipartite quantum games are implemented in terms of the discrete-time quantum walk on the line. Our proposal allows for conditional strategies, as two rational agents make a choice from a restricted set of two-qubit unitary…
This paper unifies the concepts of evolutionary games and quantum strategies. First, we state the formulation and properties of classical evolutionary strategies, with focus on the destinations of evolution in 2-player 2-strategy games. We…
A sequence of spin-1/2 particles polarised in one of two possible directions is presented to an experimenter, who can wager in a double-or-nothing game on the outcomes of measurements in freely chosen polarisation directions. Wealth is…
The challenge of programming classical computers to play traditional, competitive games against human players has helped to advance classical hardware and software. Quantum computers have the potential to play games in a unique way:…
We study two-player games on finite graphs. Turn-based games have many nice properties, but concurrent games are harder to tame: e.g. turn-based stochastic parity games have positional optimal strategies, whereas even basic concurrent…
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…
John Bell taught us that quantum mechanics can not be reproduced by non-contextual and local Hidden variable theory. The impossibility of replacing quantum mechanics by non-contextual Hidden Variable Theory can be turned to a impossible…
Entangled quantum systems can exhibit correlations that cannot be simulated classically. For historical reasons such correlations are called "Bell inequality violations." We give two new two-player games with Bell inequality violations that…
Quantum entanglement, perhaps the most non-classical manifestation of quantum information theory, cannot be used to transmit information between remote parties. Yet, it can be used to reduce the amount of communication required to process a…
Examples of games between two partners with mixed strategies, calculated by the use of the probability amplitude as some vector in Hilbert space are given. The games are macroscopic, no microscopic quantum agent is supposed. The reason for…
Using the representation introduced in \cite{frame}, an artificial game in quantum strategy space is proposed and studied. Although it has well-known classical correspondence, which has classical mixture strategy Nash Equilibrium states,…
I give an analysis of the simplest non-commutative quantum game, which is a gambling game much like Heads or Tails. The quantum gamespace displays strategies which are not interpretable through direct-product strategies of the two players.…
We investigate the consequences of allowing players to adopt strategies which take advantage of quantum randomization devices. In games of full information, the resulting equilibria are always correlated equilibria, but not all correlated…
Understanding the role that quantum entanglement plays as a resource in various information processing tasks is one of the crucial goals of quantum information theory. Here we propose a new perspective for studying quantum entanglement:…
While it is known that shared quantum entanglement can offer improved solutions to a number of purely cooperative tasks for groups of remote agents, controversy remains regarding the legitimacy of quantum games in a competitive setting--in…
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…
We investigate the quantization of games in which the players can access to a continuous set of classical strategies, making use of continuous-variable quantum systems. For the particular case of the Cournot's Duopoly, we find that, even…
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 extend the concept of a classical two-person static game to the quantum domain, by giving an Hilbert structure to the space of classical strategies and studying the Battle of the Sexes game. We show that the introduction of entangled…