sherrington-kirkpatrick-game-complex-dynamics

name	sherrington-kirkpatrick-game-complex-dynamics
description	Complex dynamics in the Sherrington-Kirkpatrick (SK) game methodology — game-theoretic foundation for adaptive learning in disordered many-player systems with random payoff matrices. Generalizes the SK spin-glass model to game theory with random-field bias, grand-canonical abstention, and convergence/volatility phase diagram. Bridges spin-glass neural network theory, reinforcement learning, and game theory. arXiv:2607.02422
metadata	{"arxiv_id":"2607.02422","published":"2026-07-02","authors":"Desmond Chan, Tobias Galla","tags":["sherrington-kirkpatrick","spin-glass","game-theory","neural-dynamics","adaptive-learning","disordered-systems","hopfield-network","statistical-mechanics"]}
license	Complete terms in LICENSE.txt

Complex Dynamics in the Sherrington-Kirkpatrick Game

arXiv: 2607.02422 (Submitted 2 Jul 2026) Authors: Desmond Chan, Tobias Galla Category: cond-mat.dis-nn; cs.GT; physics.soc-ph

Overview

A game-theoretic foundation for the Sherrington-Kirkpatrick (SK) game — adaptive learning dynamics of many players engaging in random two-strategy two-player games with quenched-disorder payoff matrices. The SK game connects spin-glass theory (the mathematical foundation of Hopfield neural networks) to multi-agent reinforcement learning and game theory. This paper provides the first complete characterization of learning stability for SK games with general random bias and introduces a grand-canonical extension where players may abstain.

Core Contributions

1. Game-Theoretic Foundation for the SK Game

• Generates payoff matrices randomly at the start (quenched disorder) and keeps them fixed during learning — analog of SK spin-glass coupling matrix
• The Garnier-Brun–Benzaquen–Bouchaud model is a special case (no bias toward any strategy)
• This paper extends to SK games with general random bias (random fields in spin-glass language)

2. Stability of Learning with Random Fields

• Random bias toward strategies affects the nature of the stable state
• Determines when adaptive learning converges:
  • Unique fixed point: simple convergence
  • Multiple fixed points: history-dependent outcomes (spin-glass-like frustration)
  • Persistent volatility: ongoing chaotic dynamics

3. Grand-Canonical SK Game

• Players can choose to abstain (not participate) — analog of grand-canonical ensemble in statistical mechanics
• Stability analysis for this extended game type
• Connects to sparse network participation in neuroscience (not all neurons fire in every pattern)

4. Key Parameters Governing Dynamics

• Memory-loss rate (discount factor in RL): how fast players forget past payoffs
• Competitiveness of the game: zero-sum vs mixed-motive structure
• These two parameters generate a phase diagram of learning outcomes

Methodology

Generating Function / Path-Probability Approach

1. Quenched disorder: Draw N×N payoff matrices from a distribution (Gaussian or biased)
2. Adaptive dynamics: Players update strategies based on cumulative payoff history with memory-loss rate α
3. Generating function: Average over disorder using replicas or cavity methods
4. Fixed-point analysis: Linearize dynamics around candidate fixed points; test stability
5. Phase boundaries: Identify transitions between unique-FP, multi-FP, and volatile regimes as functions of α and competitiveness

Connection to Spin-Glass Neural Network Theory

• SK model → Hopfield network energy landscape
• Random payoff matrix → random coupling J_ij
• Strategy bias → random external field h_i
• Memory-loss rate → temperature-like parameter controlling frustration
• Multiple fixed points → metastable states in energy landscape (memory attractors)

Applications to Neuroscience and Neural Dynamics

1. Hopfield Network Theory

• SK spin glass is the foundation of Hopfield associative memory
• Random-field extension models biased memory storage (prior knowledge affecting attractor structure)
• Grand-canonical extension models sparse coding in hippocampal memory

2. Multi-Agent Reinforcement Learning

• Provides analytic phase boundaries for when multi-agent RL converges vs oscillates
• Memory-loss rate α directly maps to discount factor γ in RL
• Competitive games map to adversarial neural training (GAN-like dynamics)

3. Complex Systems and Social Dynamics

• Models learning in complex strategic environments (brain networks as multi-agent systems)
• Explains why complex multi-player situations are frequently unlearnable even with binary choices

Key Formulas

SK Game Hamiltonian (analogy)

H = -Σ_{i<j} J_ij s_i s_j - Σ_i h_i s_i

where J_ij ~ random payoff coupling, h_i ~ random strategy bias, s_i ∈ {+1, -1} strategy

Learning Dynamics

x_i(t+1) = (1-α) x_i(t) + Δπ_i(t)
s_i(t) = sign[x_i(t)]

where x_i is cumulative preference, α is memory-loss rate, Δπ_i is incremental payoff

Stability Condition (schematic)

• Unique FP when α > α_c(competitiveness)
• Multiple FPs / glassy regime when α < α_c
• Persistent volatility at extreme competitiveness

Implementation Notes

• N: large number of players (thermodynamic limit N→∞ for analytic results)
• Payoff distribution: Gaussian with mean μ and variance σ² tuning competitiveness
• Bias distribution: random h_i ~ N(h_0, σ_h²)
• Grand-canonical: add abstention threshold θ_i; player abstains if |x_i| < θ_i
• Simulations use N = 100–1000 players, 10⁴–10⁵ time steps

Pitfalls and Caveats

1. Not a direct neuroscience paper — the connection to neural dynamics is via spin-glass theory (Hopfield networks), not experimental brain data. Treat as theoretical foundation for understanding disordered neural systems.
2. Thermodynamic limit assumption — analytic results assume N→∞; finite-size corrections matter for real neural circuits (~10⁴–10¹¹ neurons depending on region).
3. Two-strategy restriction — real neurons have continuous firing rates; the binary strategy model is an abstraction. Extensions to continuous strategies require different analysis.
4. Quenched disorder assumption — payoff matrices fixed at start. In real neural systems, synapses slowly drift (annealed disorder), which can change phase boundaries.

Related Skills

• mean-field-oscillatory-dynamics-low-rank-networks — mean-field theory for low-rank RNNs (Zheng, Miller, Fiete 2026)
• stationary-covariance-spectra-non-normal-dynamics — non-normal random recurrent dynamics
• chaos-synchrony-ei-networks — chaos theory in E/I networks
• attractor-models-language-reasoning — attractor dynamics for cognition
• chaos-freezing-without-plasticity — Onsager reaction term chaos stabilization

References

1. Chan, D. & Galla, T. (2026). Complex dynamics in the Sherrington-Kirkpatrick game. arXiv:2607.02422
2. Garnier-Brun, J., Benzaquen, M. & Bouchaud, J.-P. (2022). The Sherrington-Kirkpatrick game. Original SK game model.
3. Sherrington, D. & Kirkpatrick, S. (1975). Solvable model of a spin-glass. Physical Review Letters.
4. Hopfield, J.J. (1982). Neural networks and physical systems with emergent collective computational abilities. PNAS.