Related papers: Dominant Strategies in Two Qubit Quantum Computati…
Two qubit quantum computations are viewed as two player, strictly competitive games and a game-theoretic measure of optimality of these computations is developed. To this end, the geometry of Hilbert space of quantum computations is used to…
Nash equilibrium is one of the most influential solution concepts in game theory. With the development of computer science and artificial intelligence, there is an increasing demand on Nash equilibrium computation, especially for Internet…
This letter reports a novel application of game theory to quantum informational processes which can be used to optimally classify data generated by these processes. To this end, the notion of simultaneously distinguishing a pure quantum…
The noncooperative Nash equilibrium solution of classical games corresponds to a rational expectations attitude on the part of the players. However, in many cases, games played by human players have outcomes very different from Nash…
Nash equilibria are crucial for understanding game behavior and systems in economics, physics, biology, and computer science. A significant application arises from the connection between Nash equilibria and optimization problems . However,…
A working definition of the term \quantum game" is developed in an attempt to gain insights into aspects of quantum mechanics via game theory.
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…
Nash equilibrium is the most commonly-used notion of equilibrium in game theory. However, it suffers from numerous problems. Some are well known in the game theory community; for example, the Nash equilibrium of repeated prisoner's dilemma…
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…
This paper investigates Nash equilibrium (NE) seeking problems for noncooperative games over multi-players networks with finite bandwidth communication. A distributed quantized algorithm is presented, which consists of local gradient play,…
With respect to probabilistic mixtures of the strategies in non-cooperative games, quantum game theory provides guarantee of fixed-point stability, the so-called Nash equilibrium. This permits players to choose mixed quantum strategies that…
In this paper we review our earlier work on quantum computing and the Nash Equilibrium, in particular, tracing the history of the discovery of new Nash Equilibria and then reviewing the ways in which quantum computing may be expected to…
In a recent paper, Eisert et al. presented a quantum mechanical generalization of Prisoner's Dilemma. They asserted that the maximally entangled game exhibits a unique Nash equilibrium which yields a pay-off equivalent to cooperative…
We characterize Nash equilibrium by postulating coherent behavior across varying games. Nash equilibrium is the only solution concept that satisfies the following axioms: (i) strictly dominant actions are played with positive probability,…
We initiate the study of quantum races, games where two or more quantum computers compete to solve a computational problem. While the problem of dueling algorithms has been studied for classical deterministic algorithms, the quantum case…
Methods of exploring Nash equilibrium in quantum games are studied. Analytical conditions of the existence, the uniqueness or the multiplicity of the equilibria are found.
A quantum Cournot game of which classical form game has multiple Nash equilibria is examined. Although the classical equilibria fail to be Pareto optimal, the quantum equilibrium exhibits the following two properties, (i) if the measurement…
Contemporary applications of machine learning in two-team e-sports and the superior expressivity of multi-agent generative adversarial networks raise important and overlooked theoretical questions regarding optimization in two-team games.…
In the Eisert protocol for 2 X 2 quantum games [Phys. Rev. Lett. 83, 3077], a number of authors have investigated the features arising from making the strategic space a two-parameter subset of single qubit unitary operators. We argue that…
Adiabatic quantum computing is implemented on specialized hardware using the heuristics of the quantum annealing algorithm. This setup requires the addressed problems to be formatted as discrete quadratic functions without constraints and…