相关论文: Quantum correlations and Nash equilibria of a bi-m…

A fair gambling is hard to be made between two spatially separated parties without introducing a trusted third party. Here we propose a novel gambling protocol, which enables fair gambling between two distant parties without the help of a…

We use techniques from the statistical mechanics of disordered systems to analyse the properties of Nash equilibria of bimatrix games with large random payoff matrices. By means of an annealed bound, we calculate their number and analyse…

A systematic theory is introduced that describes stochastic effects in game theory. In a biological context, such effects are relevant for the evolution of finite populations with frequency-dependent selection. They are characterized by…

We discuss a connection between Bell nonlocality and Bayesian games. This link offers interesting perspectives for Bayesian games, namely to allow the players to receive advice in the form of nonlocal correlations, for instance using…

Quantum games, like quantum algorithms, exploit quantum entanglement to establish strong correlations between strategic player actions. This paper introduces quantum game-theoretic models applied to trading and demonstrates their…

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…

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…

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…

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…

In an $\epsilon$-Nash equilibrium, a player can gain at most $\epsilon$ by unilaterally changing his behaviour. For two-player (bimatrix) games with payoffs in $[0,1]$, the best-known$\epsilon$ achievable in polynomial time is 0.3393. In…

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…

We outline the general construction of three-players games with incomplete information which fulfil the following conditions: (i) symmetry with respect to the exchange of the players; (ii) the existence of the upper bound for total payoff…

We propose a scheme for a quantum game based on performing an EPR type experiment and in which each player's spatial directional choices are considered as their strategies. A classical mixed-strategy game is recovered by restricting the…

Game-theoretic techniques and equilibria analysis facilitate the design and verification of competitive systems. While algorithmic complexity of equilibria computation has been extensively studied, practical implementation and application…

We revisit the complexity of deciding, given a {\it bimatrix game,} whether it has a {\it Nash equilibrium} with certain natural properties; such decision problems were early known to be ${\mathcal{NP}}$-hard~\cite{GZ89}. We show that…

An example of the macroscopic game of two partners consisting of two classical games played simultaneously with special dependence of strategies is considered. The average profit of each partner is equal to the average profit obtained in…

The concept of forming harmonious coalitions is introduced to both classical and quantum symmetric cooperative game. In both cases, players are motivated to form coalitions. Also, the main feature of the cooperative game is conserved.

In general, Nash equilibria in normal-form games may require players to play (probabilistically) mixed strategies. We define a measure of the complexity of finite probability distributions and study the complexity required to play Nash…

We investigate the 3-player quantum Prisoner's Dilemma with a certain strategic space, a particular Nash equilibrium that can remove the original dilemma is found. Based on this equilibrium, we show that the game is enhanced by the…

We introduce new theoretical insights into two-population asymmetric games allowing for an elegant symmetric decomposition into two single population symmetric games. Specifically, we show how an asymmetric bimatrix game (A,B) can be…