Related papers: An artificial game with equilibrium state of entan…
The paper introduces a new approach to theory of differential games in which entangled players try to predict and influence actions of their adversaries. The entanglement is generated be a joint probability density known by the players.…
Classical game theory is a powerful tool focusing on optimized resource distribution, allocation and sharing in classical wired and wireless networks. As quantum networks are emerging as a means of providing true connectivity between…
Normal-form two-player games are categorized by players into K analogy classes so as to minimize the prediction error about the behavior of the opponent. This results in Clustered Analogy-Based Expectation Equilibria in which strategies are…
This paper demonstrates the quantization of a spatial Cournot duopoly model with product choice, a two stage game focusing on non-cooperation in locations and quantities. With quantization, the players can access a continuous set of…
In this paper, we generalize to three players the well-known CHSH quantum game. To do so, we consider all possible 3 variables Boolean functions and search among them which ones correspond to a game scenario with a quantum advantage (for a…
Distributed Nash equilibrium (NE) seeking problem for multi-coalition games has attracted increasing attention in recent years, but the research mainly focuses on the case without agreement demand within coalitions. This paper considers a…
In quantum games based on 2-player--$N$-strategies classical games, each player has a quNit (a normalized vector in an $N$-dimensional Hilbert space ${\cal H}_N$) upon which he applies his strategy (a matrix $U \in$ SU(N)). The players draw…
The fundamental laws of quantum world upsets the logical foundation of classic physics. They are completely counter-intuitive with many bizarre behaviors. However, this paper shows that they may make sense from the perspective of a general…
We present a perspective on quantum games that focuses on the physical aspects of the quantities that are used to implement a game. If a game is to be played, it has to be played with objects and actions that have some physical existence.…
Synthesis of finite-state controllers from high-level specifications in multi-agent systems can be reduced to solving multi-player concurrent games over finite graphs. The complexity of solving such games with qualitative objectives for…
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…
We study the extension of classical games to the quantum domain, generated by the addition of one unitary strategy to two classical strategies of each player. The conditions that need to be met by unitary operations to ensure that the…
In this paper, we study finite-agent linear-quadratic games on graphs. Specifically, we propose a comprehensive framework that extends the existing literature by incorporating heterogeneous and interpretable player interactions. Compared to…
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…
Quantum game theory offers a lot of interesting questions, and it is relevant to use the quantum information theory to resolve or improve games with lack of information : how to use the power of quantum entanglement to show the superiority…
S. J. van Enk and R. Pike in PRA 66, 024306 (2002) argue that the equilibrium solution to a quantum game isn't unique but is already present in the classical game itself. In this work, we contest this assertion by showing that a random…
We introduce a new board game based on the ancient Chinese game of Go (Weiqi, Igo, Baduk). The key difference from the original game is that players no longer alternatively play single stones on the board but instead they take turns placing…
In this paper, we investigate the seeking of Nash equilibrium (NE) in a non-cooperative quadratic game where all agents exchange their delayed strategy information with their neighbors. To extend best-response algorithms to the delayed…
We propose a reinforcement learning algorithm for stationary mean-field games, where the goal is to learn a pair of mean-field state and stationary policy that constitutes the Nash equilibrium. When viewing the mean-field state and the…
In a one-off Minority game, when a group of players agree to collaborate they gain an advantage over the remaining players. We consider the advantage obtained in a quantum Minority game by a coalition sharing an initially entangled state…