Related papers: Quantum-over-classical Advantage in Solving Multip…
The game in which acts of participants don't have an adequate description in terms of Boolean logic and classical theory of probabilities is considered. The model of the game interaction is constructed on the basis of a non-distributive…
The semigroup game is a two-person zero-sum game defined on a semigroup S as follows: Players 1 and 2 choose elements x and y in S, respectively, and player 1 receives a payoff f(xy) defined by a function f from S to [-1,1]. If the…
Game Theory studies situations in which multiple agents having conflicting objectives have to reach a collective decision. The question of a compact representation language for agents utility function is of crucial importance since the…
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…
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…
In this paper, we explore the historical development of playable quantum physics related games (\textit{\textbf{quantum games}}). For the purpose of this examination, we have collected over 260 quantum games ranging from commercial games,…
We give a converging semidefinite programming hierarchy of outer approximations for the set of quantum correlations of fixed dimension and derive analytical bounds on the convergence speed of the hierarchy. In particular, we give a…
Quantum generalizations of conventional games broaden the range of available strategies, which can help improve outcomes for the participants. With many players, such quantum games can involve entanglement among many states which is…
We investigate the consequences of allowing players to adopt strategies which take advantage of quantum randomization devices. In games of full information, the resulting equilibria are always correlated equilibria, but not all correlated…
We address the question of when quantum entanglement is a useful resource for information processing tasks by presenting a new class of nonlocal games that are simple, direct, generalizations of the Clauser Horne Shimony Holt game. For some…
Quantum game theory has emerged as a promising candidate to further the understanding of quantum correlations. Motivated by this, it is demonstrated that pure strategy Nash equilibria can be utilised as a mechanism to witness and determine…
Quantum guessing games form a versatile framework for studying different tasks of information processing. A quantum guessing game with posterior information uses quantum systems to encode messages and classical communication to give partial…
We revisit classic algorithmic search and optimization problems from the perspective of competition. Rather than a single optimizer minimizing expected cost, we consider a zero-sum game in which an optimization problem is presented to two…
This article presents a unified probabilistic framework that allows both rational and irrational decision making to be theoretically investigated and simulated in classical and quantum games. Rational choice theory is a basic component of…
A new combinatorial game is given. It generalizes both Substraction and Nim. It is proved the computation of Nash equilibrium points in this new game is NP-hard.
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…
In many multiagent environments, a designer has some, but limited control over the game being played. In this paper, we formalize this by considering incompletely specified games, in which some entries of the payoff matrices can be chosen…
We define a two-player combinatorial game in which players take alternate turns; each turn consists on deleting a vertex of a graph, together with all the edges containing such vertex. If any vertex became isolated by a player's move then…
In a recent arXiv-manuscript Fox studies infinite subtraction games with a finite (ternary) and aperiodic Sprague-Grundy function. Here we provide an elementary example of a game with the given properties, namely the game given by the…
A simple but nontrivial class of the quantum strategies in buying-selling games is presented. The player moves are a rational buying and an unconditional selling. The possibility of gaining extremal profits in such the games is considered.…