[Paper Review] Quantum two-players games, Entanglement and Nash equilibria

Katarzyna Bolonek-Lasoń|arXiv (Cornell University)|Feb 17, 2014

Quantum Mechanics and Applications5 references3 citations

TL;DR

This paper proves that in N-strategy quantum two-player games quantized via the Eisert-Lewenstein-Wilkens scheme, no nontrivial pure Nash equilibrium exists when the initial state is maximally entangled and all unitary strategies are allowed. The proof relies on group-theoretic analysis of the stability subgroup of the initial state under the action of SU(N)×SU(N), showing that for any strategy, a counter-strategy always exists, rendering nontrivial equilibria impossible.

ABSTRACT

The two-players N strategies games quantized according to the Eisert-Lewenstein-Wilkens scheme [1] are considered. It is shown that in the case of maximal entanglement no nontrivial pure Nash equilibrium exists. The proof relies on simple geometric properties of "chiral" group $SU (N) imes SU(N)$ and is based on considering the stability subgroup of the initial state of the game. The explicit forms of neither the gate operator nor the payoff matrix are necessary.

Motivation & Objective

• To investigate the existence of pure Nash equilibria in quantized two-player games with N strategies under maximal entanglement.
• To determine whether nontrivial equilibria can emerge when all unitary strategies are permitted in the quantum game framework.
• To clarify the role of the initial state's entanglement and the structure of the strategy space in determining equilibrium existence.
• To establish a general group-theoretic condition for the nonexistence of pure Nash equilibria in such games, independent of payoff matrix or gate operator form.

Proposed method

• Analyzes the stability subgroup of the maximally entangled initial state |Ψi⟩ under the action of SU(N)×SU(N).
• Uses the condition U_A ⊗ U_B |Ψi⟩ = |Ψi⟩ to derive the relation U_A F̃ U_BT = F̃, where F̃ = √N F is unitary.
• Identifies the general solution as U_A = U, U_B = F̃ Ū F̃⁺, showing the stability subgroup is isomorphic to SU(N) via diagonal embedding.
• Applies a coset decomposition of SU(N)×SU(N) to show that for any strategy V chosen by Alice, a counter-strategy exists in the form of U₂F̃Ū₁⁺V F̃⁺.
• Demonstrates that the existence of such counter-strategies implies no stable pure strategy profile can exist unless all classical strategy pairs are already optimal.
• Relies solely on geometric and group-theoretic properties of SU(N)×SU(N), avoiding explicit forms of the gate operator or payoff matrix.

Experimental results

Research questions

• RQ1 Does a nontrivial pure Nash equilibrium exist in an N-strategy quantum game when the initial state is maximally entangled and all unitary strategies are allowed?
• RQ2 What is the structure of the stability subgroup of the maximally entangled initial state under SU(N)×SU(N) action?
• RQ3 How does the coset space SU(N)×SU(N)/diag(SU(N)×SU(N)) relate to the existence of counter-strategies in quantum games?
• RQ4 Can the nonexistence of pure Nash equilibria be established without knowledge of the payoff matrix or gate operator?
• RQ5 Under what conditions does a pure strategy profile become a trivial equilibrium in such quantum games?

Key findings

• No nontrivial pure Nash equilibrium exists in N-strategy quantum games under maximal entanglement when all unitary strategies are allowed.
• The stability subgroup of the maximally entangled initial state is isomorphic to SU(N), embedded diagonally in SU(N)×SU(N).
• For every strategy chosen by one player, a counter-strategy exists that nullifies any advantage, preventing equilibrium formation.
• The existence of such counter-strategies is a direct consequence of the group structure of the stability subgroup and the coset decomposition of SU(N)×SU(N).
• The result holds independently of the explicit form of the gate operator or the payoff matrix, relying only on the symmetry and unitarity of the system.
• The only pure Nash equilibria possible are trivial, corresponding to classical strategy pairs that are already optimal for both players.