Entanglement, Evolutionary Stability, and Strategy-Space Dependence in an EWL Quantum Game
- URL: http://arxiv.org/abs/2607.21103v1
- Date: Thu, 23 Jul 2026 09:32:21 GMT
- Title: Entanglement, Evolutionary Stability, and Strategy-Space Dependence in an EWL Quantum Game
- Abstract summary: quantization affects evolutionary stability in a symmetric $2times2$ game.<n>We show that entanglement stabilizes the equilibrium only within the restricted EWL strategy space.
- Score: 1.901453512012934
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We examine how Eisert--Wilkens--Lewenstein (EWL) quantization affects evolutionary stability in a symmetric $2\times2$ game whose interior mixed Nash equilibrium is not evolutionarily stable. In the restricted two-parameter EWL strategy space, the quantum equilibrium $s^*=(π/2,π/4)$ becomes a strict symmetric Nash equilibrium, and hence an evolutionarily stable strategy, for every $γ>0$. Extending the admissible pure strategies to the full three-parameter $SU(2)$ family preserves the Nash equilibrium but introduces a continuum of payoff-neutral mutants, causing strictness and the second ESS condition to fail. Thus, entanglement stabilizes the equilibrium only within the restricted EWL strategy space; the effect does not survive enlargement to full $SU(2)$.
Related papers
- Paradoxes of Game Theoretic Equilibria and Price of Anarchy [36.44731230315158]
We show that reducing multi-agent learning to equilibrium obscures underlying dynamic disequilibrium and gameoretic bounds.<n>Worst-case pure Nash equilibria dictating robust Price of Anarchy bounds manifest as topologically unstable strict saddles.<n> projecting learning trajectories onto the discrete simplex of correlated play systematically accommodates non-rationalizable behavior.
arXiv Detail & Related papers (2026-07-13T16:09:35Z) - Entanglement in the Quantum Volunteer's Dilemma [0.0]
We study a quantum version of the Volunteer's Dilemma game theory.<n>We find that maximal entanglement is not required to sustain symmetric Nash equilibria.<n>This characterization is directly relevant for implementations on resource-constrained quantum devices.
arXiv Detail & Related papers (2026-06-06T15:31:16Z) - Risk-Dominant Equilibrium in Quantum Prisoner's Dilemma [0.0]
We find that entanglement completely controls the risk-dominant equilibrium.
Entanglement promotes quantum-cooperation in the risk-dominant equilibrium and thus improves its outcome.
arXiv Detail & Related papers (2024-06-22T09:37:27Z) - On Tractable $Φ$-Equilibria in Non-Concave Games [53.212133025684224]
We study tractable $Phi$-equilibria in non-concave games.<n>We show that when $Phi$ is finite, there exists an efficient uncoupled learning algorithm that converges to the corresponding $Phi$-equilibria.
arXiv Detail & Related papers (2024-03-13T01:51:30Z) - A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games [95.50895904060309]
We introduce the Optimistic Matrix Multiplicative Weights Update (OMMWU) algorithm and establish its average-iterate convergence complexity as $mathcalO(d/epsilon)$ to $epsilon$-Nash equilibria.<n>This quadratic speed-up sets a new benchmark for computing $epsilon$-Nash equilibria in quantum zero-sum games.
arXiv Detail & Related papers (2023-11-17T20:38:38Z) - Differentiable Arbitrating in Zero-sum Markov Games [59.62061049680365]
We study how to perturb the reward in a zero-sum Markov game with two players to induce a desirable Nash equilibrium, namely arbitrating.
The lower level requires solving the Nash equilibrium under a given reward function, which makes the overall problem challenging to optimize in an end-to-end way.
We propose a backpropagation scheme that differentiates through the Nash equilibrium, which provides the gradient feedback for the upper level.
arXiv Detail & Related papers (2023-02-20T16:05:04Z) - $2 \ imes 2$ Zero-Sum Games with Commitments and Noisy Observations [1.9654639120238482]
The equilibrium of a $2times2$ zero-sum game is shown to always exist.
Observering the actions of the leader is shown to be either beneficial or immaterial for the follower.
The payoff at the equilibrium of this game is upper bounded by the payoff at the Stackelberg equilibrium (SE) in pure strategies.
arXiv Detail & Related papers (2022-11-03T10:56:00Z) - The Franke-Gorini-Kossakowski-Lindblad-Sudarshan (FGKLS) Equation for
Two-Dimensional Systems [62.997667081978825]
Open quantum systems can obey the Franke-Gorini-Kossakowski-Lindblad-Sudarshan (FGKLS) equation.
We exhaustively study the case of a Hilbert space dimension of $2$.
arXiv Detail & Related papers (2022-04-16T07:03:54Z) - Sample-Efficient Learning of Stackelberg Equilibria in General-Sum Games [78.65798135008419]
It remains vastly open how to learn the Stackelberg equilibrium in general-sum games efficiently from samples.
This paper initiates the theoretical study of sample-efficient learning of the Stackelberg equilibrium in two-player turn-based general-sum games.
arXiv Detail & Related papers (2021-02-23T05:11:07Z) - No-regret learning and mixed Nash equilibria: They do not mix [64.37511607254115]
We study the dynamics of "follow-the-regularized-leader" (FTRL)
We show that any Nash equilibrium which is not strict cannot be stable and attracting under FTRL.
This result has significant implications for predicting the outcome of a learning process.
arXiv Detail & Related papers (2020-10-19T13:49:06Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.