Related papers: Remarks on quantum duopoly schemes

This paper is intended to investigate the dynamics of heterogeneous Cournot duopoly games, where the first players adopt identical gradient adjustment mechanisms but the second players are endowed with distinct rationality levels. Based on…

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…

In this work we successfully present a quantum version of the multiplayer Colonel Blotto game. We find that players with access to the quantum strategies has a advantage over the classical ones. The payoff is invariant under the order of…

A system of unitary transformations providing two optimal copies of an arbitrary input cubit is obtained. An algorithm based on classical Boolean algebra and allowing one to find any unitary transformation realized by the quantum CNOT…

We consider potential games with mixed-integer variables, for which we propose two distributed, proximal-like equilibrium seeking algorithms. Specifically, we focus on two scenarios: i) the underlying game is generalized ordinal and the…

In these lecture notes we investigate the implications of the identification of strategies with quantum operations in game theory beyond the results presented in [J. Eisert, M. Wilkens, and M. Lewenstein, Phys. Rev. Lett. 83, 3077 (1999)].…

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…

We study the advantages of quantum strategies in evolutionary social dilemmas on evolving random networks. We focus our study on the two-player games: prisoner's dilemma, snowdrift and stag-hunt games. The obtained result show the benefits…

Main papers on quantum games are written by physicists for physicists, and the inevitable exploitation of physics jargon may create difficulties for mathematicians or economists. Our goal here is to make clear the physical content and to…

We quantize prisoners dilemma and chicken game by our generalized quantization scheme to explore the role of quantum discord in quantum games. In order to establish this connection we use Werner-like state as an initial state of the game.…

We introduce Q-Nash, a quantum annealing algorithm for the NP-complete problem of Fnding pure Nash equilibria in graphical games. The algorithm consists of two phases. The first phase determines all combinations of best response strategies…

A sequence of spin-1/2 particles polarised in one of two possible directions is presented to an experimenter, who can wager in a double-or-nothing game on the outcomes of measurements in freely chosen polarisation directions. Wealth is…

A general quantum algorithm for solving a problem is discussed. The number of steps required to solve a problem using this method is independent of the number of cases that has to be considered classically. Hence, it is more efficient than…

A quantum version of the Minority game for an arbitrary number of agents is considered. It is known that when the number of agents is odd, quantizing the game produces no advantage to the players, but for an even number of agents new Nash…

Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time…

Repeated quantum game theory addresses long term relations among players who choose quantum strategies. In the conventional quantum game theory, single round quantum games or at most finitely repeated games have been widely studied, however…

The $N$-player quantum game is analyzed in the context of an Einstein-Podolsky-Rosen (EPR) experiment. In this setting, a player's strategies are not unitary transformations as in alternate quantum game-theoretic frameworks, but a classical…

N. Vyas and C. Benjamin (arXiv:1701.08573[quant-ph]) propose a new mixed strategy for the (quantum) Hawk-Dove and Prisoners' Dilemma games and argue that this strategy yields payoffs, which cannot be obtained in the corresponding classical…

In this paper we describe a quantum algorithm to solve sparse systems of nonlinear differential equations whose nonlinear terms are polynomials. The algorithm is nondeterministic and its expected resource requirements are polylogarithmic in…

The theory of quantum games permits players to choose strategies that prepare and measure quantum states. Whereas conventional game theory provides guarantees for fixed-point stability in non-cooperative games, so-called Nash equilibria, we…