相关论文: Parrondo Games and Quantum Algorithms

Parrondo games with one-dimensional spatial dependence were introduced by Toral and extended to the two-dimensional setting by Mihailovi\'c and Rajkovi\'c. $MN$ players are arranged in an $M\times N$ array. There are three games, the fair,…

Classical game theory is a powerful tool focusing on optimized resource distribution, allocation and sharing in classical wired and wireless networks. As quantum networks are emerging as a means of providing true connectivity between…

We study the relation between the discrete--time version of the flashing ratchet known as Parrondo's games and a compression technique used very recently with thermal ratchets for evaluating the transfer of information -- negentropy --…

Game theory is the mathematical framework for analyzing strategic interactions in conflict and competition situations. In recent years quantum game theory has earned the attention of physicists, and has emerged as a branch of quantum…

Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed,…

In a one-off Minority game, when a group of players agree to collaborate they gain an advantage over the remaining players. We consider the advantage obtained in a quantum Minority game by a coalition sharing an initially entangled state…

We analyse the role of degree of entanglement for Vaidman's game in a setting where the players share a set of partially entangled three-qubit states. Our results show that the entangled states combined with quantum strategies may not be…

We define and study a collection of matroid isomorphism games corresponding to various axiomatic characterizations of matroids. These are nonlocal games played between two cooperative players. Each game is played on two matroids, and the…

The relationships between game theory and quantum mechanics let us propose certain quantization relationships through which we could describe and understand not only quantum but also classical, evolutionary and the biological systems that…

We investigate quantum games in which the information is asymmetrically distributed among the players, and find the possibility of the quantum game outperforming its classical counterpart depends strongly on not only the entanglement, but…

This article uses data from two experimental studies of two-person Prisoner's Dilemma games [1, 2] and compares the data with the theoretic predictions calculated with the use of a quantum game theoretical method. The experimental findings…

Quantization becomes a new way to study classical game theory since quantum strategies and quantum games have been proposed. In previous studies, many typical game models, such as prisoner's dilemma, battle of the sexes, Hawk-Dove game,…

We study the advantages of quantum strategies in evolutionary social dilemmas on evolving random networks. We focus our study on the two-player games: prisoner's dilemma, snowdrift and stag-hunt games. The obtained result show the benefits…

Geometric phase plays an important role in evolution of pure or mixed quantum states. However, when a system undergoes decoherence the development of geometric phase may be inhibited. Here, we show that when a quantum system interacts with…

The paper discusses coordination games with remote players that have access to an entangled quantum state. It shows that the entangled state cannot be used by players for communicating information, but that in certain games it can be used…

We present a physically appealing and elegant picture for quantum computing using rules constructed for a game of darts. A dartboard is used to represent the state space in quantum mechanics and the act of throwing the dart is shown to have…

We introduce a natural variant of weighted voting games, which we refer to as k-Prize Weighted Voting Games. Such games consist of n players with weights, and k prizes, of possibly differing values. The players form coalitions, and the i-th…

A combinatorial game is a two-player game without hidden information or chance elements. The main object of combinatorial game theory is to obtain the outcome, which player has a winning strategy, of a given combinatorial game. Positions of…

Playing a symmetric bi-matrix game is usually physically implemented by sharing pairs of 'objects' between two players. A new setting is proposed that explicitly shows effects of quantum correlations between the pairs on the structure of…

We present the first study of a dynamical quantum game. Each agent has a `memory' of her performance over the previous m timesteps, and her strategy can evolve in time. The game exhibits distinct regimes of optimality. For small m the…