Related papers: An introduction to multi-player, multi-choice quan…
This paper examines the integration of computational complexity into game theoretic models. The example focused on is the Prisoner's Dilemma, repeated for a finite length of time. We show that a minimal bound on the players' computational…
We define generalized quantum games by introducing the coherent payoff operators and propose a simple scheme to illustrate it. The scheme is implemented with a single spin qubit system and two entangled qubit system. The Nash Equilibrium…
Using the representation introduced in our another paper\cite{frame}, the well-known Quantum Prisoner's Dilemma proposed in \cite{jens}, is reexpressed and calculated. By this example and the works in \cite{frame} on classical games and…
The game of Prisoner Dilemma is analyzed to study the role of measurement basis in quantum games. Four different types of payoffs for quantum games are identified on the basis of different combinations of initial state and measurement…
In game theory, a popular model of a struggle for survival among three competing agents is a truel, or three person generalization of a duel. Adopting the ideas recently developed in quantum game theory, we present a quantum scheme for the…
An approach towards quantum games is proposed that uses the unusual probabilities involved in EPR-type experiments directly in two-player games.
The present work is an introductory study about entropy its properties and its role in quantum information theory. In a next work, we will use these results to the analysis of a quantum game described by a density operator and with its…
We apply a Bayesian agent-based framework inspired by QBism to iterations of two quantum games, the CHSH game and the quantum prisoners' dilemma. In each two-player game, players hold beliefs about an amount of shared entanglement and about…
Quantum game theory, whatever opinions may be held due to its abstract physical formalism, have already found various applications even outside the orthodox physics domain. In this paper we introduce the concept of a quantum auction, its…
Quantum algorithms are demonstrated to outperform classical algorithms for certain problems and thus are promising candidates for efficient information processing. Herein we aim to provide a brief and popular introduction to quantum…
Games with unawareness model strategic situations in which players' perceptions about the game are limited. They take into account the fact that the players may be unaware of some of the strategies available to them or their opponents as…
We show that it is perfectly possible to play 'restricted' two-players, two-strategies quantum games proposed originally by Marinatto and Weber having as the only equipment a pack of 10 cards. The 'quantum board' of such a model of these…
This work, based on the author's MA thesis, concentrates on simultaneous move quantum games of two players. A numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in…
We introduce quantum XOR games, a model of two-player one-round games that extends the model of XOR games by allowing the referee's questions to the players to be quantum states. We give examples showing that quantum XOR games exhibit a…
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…
Recognise that people have many, possibly conflicting, aspects to their personality. We hypothesise that each separate characteristic of a personality may be treated as an independent player in a non-zero sum many player game. This idea is…
We give a basic overview of computational complexity, query complexity, and communication complexity, with quantum information incorporated into each of these scenarios. The aim is to provide simple but clear definitions, and to highlight…
These lecture notes attempt a mathematical treatment of game theory akin to mathematical physics. A game instance is defined as a sequence of states of an underlying system. This viewpoint unifies classical mathematical models for 2-person…
We show that quantum game theory offers solution to the famous Newcomb's paradox (free will problem). Divine foreknowledge is not necessary for successful completion of the game because quantum theory offers a way to discern human…
The Marinatto-Weber approach to quantum game is a straightforward way to apply the power of quantum mechanics to classical game theory. In the simplest case, the quantum scheme is that players manipulate their own qubits of a two-qubit…