Related papers: Quantum information approach to the ultimatum game
A new approach to play games quantum mechanically is proposed. We consider two players who perform measurements in an EPR-type setting. The payoff relations are defined as functions of *correlations*, i.e. without reference to classical or…
In another paper with the same name\cite{frame}, we proposed a new representation of Game Theory, but most results are given by specific examples and argument. In this paper, we try to prove the conclusions as far as we can, including a…
Several variants of nonlocal games have been considered in the study of quantum entanglement and nonlocality. This paper concerns two of these variants, called quantum-classical games and extended nonlocal games. We give a construction of…
We generalize the quantum Prisoner's Dilemma to the case where the players share a non maximally entangled states. We show that the game exhibits an intriguing structure as a function of the amount of entanglement with two thresholds which…
We study the extension of classical games to the quantum domain, generated by the addition of one unitary strategy to two classical strategies of each player. The conditions that need to be met by unitary operations to ensure that the…
The Ultimatum Game is conventionally formulated in the context of two players. Nonetheless, real-life scenarios often entail community interactions among numerous individuals. To address this, we introduce an extended version of the…
Recent advancements in algorithms for sequential decision-making under imperfect information have shown remarkable success in large games such as limit- and no-limit poker. These algorithms traditionally formalize the games using the…
In recent years methods have been proposed to extend classical game theory into the quantum domain. This paper explores further extensions of these ideas that may have a substantial potential for further research. Upon reformulating quantum…
We prove the existence of (one-way) communication tasks with a subconstant versus superconstant asymptotic gap, which we call "doubly infinite," between their quantum information and communication complexities. We do so by studying the…
We present a two-party protocol for quantum gambling, a new task closely related to coin tossing. The protocol allows two remote parties to play a gambling game, such that in a certain limit it becomes a fair game. No unconditionally secure…
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…
We continue the analysis of quantum-like description of markets and economics. The approach has roots in the recently developed quantum game theory and quantum computing. The present paper is devoted to quantum English auction which are a…
What makes quantum information science a science? These notes explore the idea that quantum information science may offer a powerful approach to the study of complex quantum systems. We discuss how to quantify complexity in quantum systems,…
We investigate Nash Equilibrium in the quantum Battle of Sexes Game. We find the game has infinite Nash Equilibria and all of them leads to the asymmetry result. We also show that there is no unique but infinite Nash Equilibrium in it if we…
We propose the first online quantum algorithm for solving zero-sum games with $\widetilde O(1)$ regret under the game setting. Moreover, our quantum algorithm computes an $\varepsilon$-approximate Nash equilibrium of an $m \times n$ matrix…
Quantum game theory lays a foundation for understanding the interaction of people using quantum computers with conflicting interests. Recently Zhang proposed a simple yet rich model to study quantum strategic games, and addressed some…
A quantum logic gate of particular interest to both electrical engineers and game theorists is the quantum multiplexer. This shared interest is due to the facts that an arbitrary quantum logic gate may be expressed, up to arbitrary…
Krentel [J. Comput. System. Sci., 36, pp.490--509] presented a framework for an NP optimization problem that searches an optimal value among exponentially-many outcomes of polynomial-time computations. This paper expands his framework to a…
In this paper, we propose a Quantum variation of combinatorial games, generalizing the Quantum Tic-Tac-Toe proposed by Allan Goff. A combinatorial game is a two-player game with no chance and no hidden information, such as Go or Chess. In…
A quantum game can be viewed as a state preparation in which the final output state results from the competing preferences of the players over the set of possible output states that can be produced. It is therefore possible to view state…