Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Dynamic Games

Kolokoltsov Vasili

Published Jan 1, 2020• 0 citations
OpenAlex

Related papers

Quantum games

Παναγιώτης Αποστολίδης, Εύαγγελος Κ. Κοντονικολάου

•Jan 1, 2025•0 citations

Tripartite Dynamic Zero-Sum Quantum Games

Huimin Cheng, Ming-Xing Luo

The Nash equilibrium plays a crucial role in game theory. Most of results are based on classical resources. Our goal in this paper is to explore multipartite zero-sum game with quantum settings. We find that in two different settings there is no strategy for a tripartite classical game being fair. Interestingly, this is resolved by providing dynamic zero-sum quantum games using single quantum state. Moreover, the gains of some players may be changed dynamically in terms of the committed state. Both quantum games are robust against the preparation noise and measurement errors.

Entropy•Jan 27, 2021•6 citations

Chaotic dynamics of a quantum Cournot duopoly game with heterogeneous expectations

Yuhuai Zhang, Jing Yuan, Yili Zhang

On the basis of the bounded rationality and adaptive expectations, we investigate the dynamics of quantum Cournot duopoly game with heterogeneous players by using the Li et al. scheme. Further, we discuss the effect of quantum entanglement on local stability of the system. The results show that: (i) The special form of quantum Cournot duopoly game is the classical Cournot duopoly game, and the quantum Cournot duopoly game with naïve expectation is also a special form of quantum Cournot duopoly game with adaptive expectation. (ii) The increase or decrease of the stable region is dependent on the degree of quantum entanglement. It is related to the difference of relative marginal cost. (iii) The numerical simulation reveals the complexity characteristics of quantum dynamic Cournot game system through the analysis of stability region, bifurcation, strange attractor and sensitivity to initial conditions, and shows the difference from the classical dynamic Cournot model.

International Journal of Quantum Information•Feb 3, 2023•4 citations

Quantum games

J.M.A Figueiredo

Physica A Statistical Mechanics and its Applications•Jan 27, 2004•1 citation

Learning in Quantum Common-Interest Games and the Separability Problem

Wayne Lin, Georgios Piliouras, Ryann Sim +1 more

Learning in games has emerged as a powerful tool for machine learning with numerous applications. Quantum games model interactions between strategic players who have access to quantum resources, and several recent works have studied learning in the competitive regime of quantum zero-sum games. Going beyond this setting, we introduce quantum common-interest games (CIGs) where players have density matrices as strategies and their interests are perfectly aligned. We bridge the gap between optimization and game theory by establishing the equivalence between KKT (first-order stationary) points of an instance of the Best Separable State (BSS) problem and the Nash equilibria of its corresponding quantum CIG. This allows learning dynamics for the quantum CIG to be seen as decentralized algorithms for the BSS problem. Taking the perspective of learning in games, we then introduce non-commutative extensions of the continuous-time replicator dynamics and the discrete-time best response dynamics/linear multiplicative weights update for learning in quantum CIGs. We prove analogues of classical convergence results of the dynamics and explore differences which arise in the quantum setting. Finally, we corroborate our theoretical findings through extensive experiments.

arXiv:2302.04789•Quantum•Apr 3, 2025•6 citations

Playing quantum games

Karmela Padavic-Callaghan

The New Scientist•Jul 1, 2026•0 citations
The Nash equilibrium plays a crucial role in game theory. Most of results are based on classical resources. Our goal in this paper is to explore multipartite zero-sum game with quantum settings. We find that in two different settings there is no strategy for a tripartite classical game being fair. Interestingly, this is resolved by providing dynamic zero-sum quantum games using single quantum state. Moreover, the gains of some players may be changed dynamically in terms of the committed state. Both quantum games are robust against the preparation noise and measurement errors.
On the basis of the bounded rationality and adaptive expectations, we investigate the dynamics of quantum Cournot duopoly game with heterogeneous players by using the Li et al. scheme. Further, we discuss the effect of quantum entanglement on local stability of the system. The results show that: (i) The special form of quantum Cournot duopoly game is the classical Cournot duopoly game, and the quantum Cournot duopoly game with naïve expectation is also a special form of quantum Cournot duopoly game with adaptive expectation. (ii) The increase or decrease of the stable region is dependent on the degree of quantum entanglement. It is related to the difference of relative marginal cost. (iii) The numerical simulation reveals the complexity characteristics of quantum dynamic Cournot game system through the analysis of stability region, bifurcation, strange attractor and sensitivity to initial conditions, and shows the difference from the classical dynamic Cournot model.
Learning in games has emerged as a powerful tool for machine learning with numerous applications. Quantum games model interactions between strategic players who have access to quantum resources, and several recent works have studied learning in the competitive regime of quantum zero-sum games. Going beyond this setting, we introduce quantum common-interest games (CIGs) where players have density matrices as strategies and their interests are perfectly aligned. We bridge the gap between optimization and game theory by establishing the equivalence between KKT (first-order stationary) points of an instance of the Best Separable State (BSS) problem and the Nash equilibria of its corresponding quantum CIG. This allows learning dynamics for the quantum CIG to be seen as decentralized algorithms for the BSS problem. Taking the perspective of learning in games, we then introduce non-commutative extensions of the continuous-time replicator dynamics and the discrete-time best response dynamics/linear multiplicative weights update for learning in quantum CIGs. We prove analogues of classical convergence results of the dynamics and explore differences which arise in the quantum setting. Finally, we corroborate our theoretical findings through extensive experiments.