Related papers: How to play two-players restricted quantum games w…
We consider the discrete-time quantum walk in the plane, and present a quantum implementation of Parrondo's game for four players. Physical significance of the game strategies are also discussed.
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum information with one or more other parties. In particular, we focus…
We study the problem of optimal games for the solo and coop modes of the board game Room 25 (season 1). We show that the game cannot be won in a single turn for any starting configuration, but that it can be done in two for some…
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,…
The application of the methods of quantum mechanics to game theory provides us with the ability to achieve results not otherwise possible. Both linear superpositions of actions and entanglement between the players' moves can be exploited.…
We propose an experimental implementation of a quantum game algorithm in a hybrid scheme combining the quantum circuit approach and the cluster state model. An economical cluster configuration is suggested to embody a quantum version of the…
We develop a method based on computer algebra systems to represent the mutual pure strategy best-response dynamics of symmetric two-player, two-action repeated games played by players with a one-period memory. We apply this method to the…
In this short note, we exhibit a draw in the game of Philosopher's Phutball. We construct a position on a 12 x 10 Phutball board from where either player has a drawing strategy, and then generalize it to an m x n board with m-2 >= n >= 10.
We investigate definitions of and protocols for multi-party quantum computing in the scenario where the secret data are quantum systems. We work in the quantum information-theoretic model, where no assumptions are made on the computational…
The high public attention given to quantum computing shows that it is perceived as an interesting topic. We want to utilize this motivating effect for the teaching and learning of quantum physics. Specifically, we want to take advantage of…
We propose and analyse a 2-parameter family of 2-player games on two heaps of tokens, and present a strategy based on a class of sequences. The strategy looks easy, but is actually hard. A class of exotic numeration systems is then used,…
This paper investigates the popular card game UNO from the viewpoint of algorithmic combinatorial game theory. We define simple and concise mathematical models for the game, including both cooperative and uncooperative versions, and analyze…
Iqbal and Toor [Phys. Rev. A {\bf 65}, 022306 (2002)] and [Commun. Theor. Phys. {\bf 42}, 335 (2004)] generalized the Marinatto-Weber quantum scheme for $2 \times 2$ games in order to study bimatrix games of $3 \times 3$ dimension, in…
Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the controller, while the other describes the (adversarial) environment, and…
Consider the following one player game. A deck containing $m$ copies of $n$ different card types is shuffled uniformly at random. Each round the player tries to guess the next card in the deck, and then the card is revealed and discarded.…
This brief paper describes the single-player card game called "Perpetual Motion" and reports on a computational analysis of the game's outcome. The analysis follows a Monte Carlo methodology based on a sample of 10,000 randomly generated…
We introduce a new board game based on the ancient Chinese game of Go (Weiqi, Igo, Baduk). The key difference from the original game is that players no longer alternatively play single stones on the board but instead they take turns placing…
This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other that tries to convince the verifier to reject. We prove that…
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…
In this paper we show that, given $k\geq 3$, there exist $k$-player quantum XOR games for which the entangled bias can be arbitrarily larger than the bias of the game when the players are restricted to separable strategies. In particular,…