Related papers: Comment on: "A quantum approach to static games of…

Quantum mechanics courses focus mostly on its computational aspects. This alone does not provide the same depth of understanding as most physicists have of classical mechanics. The understanding of classical mechanics is significantly…

We introduce quantitative reductions, a novel technique for structuring the space of quantitative games and solving them that does not rely on a reduction to qualitative games. We show that such reductions exhibit the same desirable…

Quantum mechanics dramatically differs from classical physics, allowing for a wide range of genuinely quantum phenomena. The goal of quantum information is to understand information processing from a quantum perspective. In this mindset, it…

In this research article, we survey existing quantum physics-related games and, based on this survey, propose a definition for the concept of quantum games. We define a quantum game as any type of rule-based game that either employs the…

The two-players N strategies games quantized according to the Eisert-Lewenstein-Wilkens scheme [1] are considered. It is shown that in the case of maximal entanglement no nontrivial pure Nash equilibrium exists. The proof relies on simple…

Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have shown that these games can be solved in quasi-polynomial time. We show that their algorithm can be implemented efficiently: we use their…

A new representation of Game Theory is developed in this paper. State of players is represented by a density matrix, and payoff function is a set of hermitian operators, which when applied onto the density matrix give the payoff of players.…

The discontinuous dependence of the properties of a quantum game on its entanglement has been shown up to be very much like phase transitions viewed in the entanglement-payoff diagram [J. Du et al., Phys. Rev. Lett, 88, 137902 (2002)]. In…

We investigate a multi-player and multi-choice quantum game. We start from two-player and two-choice game and the result is better than its classical version. Then we extend it to N-player and N-choice cases. In the quantum domain, we…

We propose a novel algorithm for the solution of mean-payoff games that merges together two seemingly unrelated concepts introduced in the context of parity games, small progress measures and quasi dominions. We show that the integration of…

We propose a simple yet rich model to extend the notions of Nash equilibria and correlated equilibria of strategic games to the quantum setting, in which we then study the relations between classical and quantum equilibria. Unlike the…

We study the applicability of quantum algorithms in computational game theory and generalize some results related to Subtraction games, which are sometimes referred to as one-heap Nim games. In quantum game theory, a subset of Subtraction…

Enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum game with the problem of data clustering, and then develop a quantum-game-based clustering algorithm, in which data points…

The Prisoners' Dilemma is perhaps the most famous model in the field of game theory. Consequently, it is natural to investigate its quantum version when one considers to apply quantum strategies to game theory. There are two main results in…

We generalize Banica's construction of the quantum isometry group of a metric space to the class of quantum metric spaces in the sense of Kuperberg and Weaver. We also introduce quantum isometries between two quantum metric spaces, and we…

This work is an application of game theory to quantum information. In a state estimate, we are given observations distributed according to an unknown distribution $P_{\theta}$ (associated with award $Q$), which Nature chooses at random from…

Schmidt games and the Cantor winning property give alternative notions of largeness, similar to the more standard notions of measure and category. Being intuitive, flexible, and applicable to recent research made them an active object of…

Quantum state targeting is a quantum game which results from combining traditional quantum state estimation with additional classical information. We consider a particular version of the game and show how it can be played with maximally…

Several problems in planning and reactive synthesis can be reduced to the analysis of two-player quantitative graph games. {\em Optimization} is one form of analysis. We argue that in many cases it may be better to replace the optimization…

For any two-by-two game $\G$, we define a new two-player game $\G^Q$. The definition is motivated by a vision of players in game $\G$ communicating via quantum technology according to a certain standard protocol originally introduced by…