pith. sign in

arxiv: 2607.01719 · v1 · pith:PXLL6ECPnew · submitted 2026-07-02 · ⚛️ physics.soc-ph

Hypergraph Minority Game with Local Hyperedge Payoffs

Yihang Zhu , Fanyuan Meng This is my paper

Pith reviewed 2026-07-03 03:30 UTC · model grok-4.3

classification ⚛️ physics.soc-ph
keywords hypergraph minority gamereplica analysiscritical surfaceglobal cost functionstochastic differential equationsminority gameorder parameterssparse regime
0
0 comments X

The pith

The deterministic drift in the hypergraph minority game derives from a global cost function that generalizes the standard Minority Game Hamiltonian to hypergraph-structured interactions; the sparse-regime transition occurs on the critical s

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Agents compete in overlapping local minority games whose groups are the hyperedges of a fixed hypergraph. The resulting score dynamics reduce to a set of coupled stochastic differential equations whose deterministic drift is the gradient of a single global cost function. A replica-symmetric analysis on k-uniform d-regular random hypergraphs produces saddle-point equations whose solution yields a critical surface α_crit(k,d) that marks the leading transition in the sparse regime. Order parameters for volatility, predictability, frustration and frozen fraction follow from the same equations and exhibit specific scaling near criticality. This construction shows how the overlap of groups alters the location of the phase transition relative to the ordinary minority game.

Core claim

The deterministic drift of the score dynamics is the gradient of a global cost function that generalizes the Minority Game Hamiltonian to hypergraph interactions. On k-uniform d-regular random hypergraphs the stationary state is found by replica-symmetric saddle-point equations whose solution defines the critical surface α_crit(k,d) for the sparse-regime transition; the associated order parameters are global volatility, predictability, hyperedge frustration and frozen fraction.

What carries the argument

A global cost function generalizing the Minority Game Hamiltonian to hypergraph-structured interactions, whose gradient supplies the deterministic drift of the agents' strategy polarizations, together with the sparse-annealed replica-symmetric saddle-point equations on the k-uniform d-regular hypergraph.

If this is right

  • The transition occurs on a critical surface α_crit(k,d) instead of the single critical value of the standard minority game.
  • Order parameters σ², θ, F_e and φ are determined by the saddle-point solutions and scale in a definite way near the surface.
  • The replica-symmetric solution is stable according to an explicit replicon criterion.
  • Finite-N fluctuations are described by a Fokker-Planck equation whose covariance matrix is fixed by the hypergraph.
  • The model reduces to the standard, networked or parallel minority game in the limits k→N, k→2 or d→∞.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Changing the hyperedge size k or regularity d provides a way to tune the critical point in systems with overlapping competitions.
  • The cavity equations may allow efficient computation of the stationary state on non-random hypergraphs via message passing.
  • If the replica-symmetric ansatz breaks, the critical surface would receive 1RSB corrections that the present analysis does not capture.
  • The noise covariance in the Fokker-Planck equation suggests that hypergraph topology directly controls the magnitude of finite-size fluctuations.

Load-bearing premise

The replica-symmetric ansatz is valid for the saddle-point equations of the stationary state on the k-uniform d-regular random hypergraph.

What would settle it

A numerical simulation of the stochastic differential equations on a finite but large k-uniform d-regular hypergraph that finds the transition location different from the predicted α_crit(k,d) surface would falsify the result.

Figures

Figures reproduced from arXiv: 2607.01719 by Fanyuan Meng, Yihang Zhu.

Figure 1
Figure 1. Figure 1: Hypergraph structure of the HMG-L model. (a) Schematic of a toy hypergraph with N = 12 agents (circles) and |E| = 4 hyperedges (shaded regions) of sizes k ∈ {3, 4}. The colored set labels list the exact membership of each hyperedge; colored squares next to a node mark the hyperedges containing that node, and thick node outlines identify overlap nodes. Each hyperedge e constitutes an independent local minor… view at source ↗
Figure 2
Figure 2. Figure 2: Model workflow of the HMG-L. (a) Each agent i selects one of their S strategies according to the Boltzmann rule based on virtual scores Us,i. (b) Within each hyperedge e, the local attendance Ae = P j∈e aj determines the minority side −sgn(Ae); agents on the minority side win. (c) Strategy scores are updated by the price-taking virtual payoff across all hyperedges the agent belongs to, creating a feedback … view at source ↗
Figure 3
Figure 3. Figure 3: Order-parameter proxies of the HMG-L (hyperdegree d = 3). (a) The mean-square polarization Q = ⟨m2 i ⟩ as a function of the control parameter α, generated from the phenomenological closure matched to the sparse critical point. (b) The Edwards￾Anderson order parameter q = N −1 P i ⟨mi⟩ 2 β . Different hyperedge sizes k = 3, 5, 11, 51 are shown, illustrating how larger sparse k shifts αc to smaller values wi… view at source ↗
Figure 4
Figure 4. Figure 4: Hyperedge frustration diagnostics in the HMG-L (d = 3). (a) Lo￾cal/global volatility ratio, Fe/[k(σ 2/N)], computed from the bounded frustration closure using σ 2/N = 4ν and intended as a diagnostic rather than a direct simulated observable. (b) Scaling plot of the frustration proxy Fe/k against αc/α, showing how the phenomeno￾logical curves are organized by the sparse critical point. 8.3 Hyperedge Frustra… view at source ↗
Figure 5
Figure 5. Figure 5: Sparse-regime phase-diagram prediction and agent-based simulations of the HMG-L. (a) Finite-N simulations of the normalized volatility ν = σ 2/(4N) as a function of α = P/N for various hyperedge sizes k at fixed hyperdegree d = 3; markers and solid connecting lines show the price-taking linear-payoff dynamics, while faint dashed curves show the sparse-RS phenomenological closure constrained to have cusps a… view at source ↗
Figure 6
Figure 6. Figure 6: Critical surface of the HMG-L model. (a) Contour plot of the sparse￾regime prediction αc(k, d) = 2d(k−1)/k2 in the (k, d) plane. The color scale indicates the value of αc; the contour αc = 0.3374 (standard MG value) is highlighted as a numerical reference, not as the dense-limit continuation of the sparse formula. (b) Three-dimensional rendering of the sparse critical surface αc(k, d), illustrating the two… view at source ↗
Figure 7
Figure 7. Figure 7: Illustrative topology proxies for the HMG-L phase diagram. (a) Mean￾field proxy comparison of three topology classes at fixed mean parameters: a uniform k-regular hypergraph (blue), a heterogeneous mixture of hyperedge sizes (red, dashed), and a scale-free hyperdegree mixture P(d) ∼ d −2.5 (green, dash-dotted). These curves are closure-based predictions, not simulation data. (b) Proxy map of the normalized… view at source ↗
Figure 8
Figure 8. Figure 8: Sparse k scan and limiting-case diagnostics. (a) Normalized-volatility proxy curves ν = σ 2/(4N) for increasing sparse hyperedge size k at fixed d = 3, shown together with the standard MG reference. This panel is not a dense-limit derivation; the true k ∼ N crossover requires a separate dense-overlap treatment. (b) The sparse￾regime critical value αc(k, d) as a function of hyperdegree d for several fixed h… view at source ↗
Figure 9
Figure 9. Figure 9: Finite-size scaling diagnostic from agent-based simulations of the HMG-L (k = 5, d = 3). (a) Simulated normalized volatility ν = σ 2/(4N) vs. α for increasing system sizes, with error bars over independent strategy and hypergraph realizations. The dashed vertical line marks the sparse prediction αc = 2d(k − 1)/k2 . (b) Scaling diagnostic using the mean-field test exponent ν¯ = 1/2 for the finite-size scali… view at source ↗
read the original abstract

We provide a theoretical derivation of the Hypergraph Minority Game with Local Hyperedge Payoffs (HMG-L), in which $N$ adaptive agents compete simultaneously in multiple overlapping groups modeled as hyperedges of a static hypergraph $\Hyper=(\Vset,\Eset)$. Each hyperedge constitutes an independent local minority game, and agents accumulate payoffs across all groups to which they belong. We derive the continuum-time limit of the score dynamics, from which we obtain a set of coupled nonlinear stochastic differential equations for the agents' strategy polarization variables. The deterministic drift is shown to derive from a global cost function that generalizes the standard Minority Game Hamiltonian to hypergraph-structured interactions. We perform a sparse-annealed replica analysis of the stationary state for the case of a $k$-uniform, $d$-regular random hypergraph, obtaining the saddle-point equations within the replica-symmetric ansatz, an explicit replicon stability criterion, and Bethe/cavity equations for sparse corrections. The leading sparse-regime transition occurs on a critical surface $\alphacrit(k,d)$, while the globally coupled MG value $\alphacrit\simeq0.3374$ is recovered only in the separate single-hyperedge limit. We derive expressions for the order parameters -- global volatility $\sigma^2$, predictability $\theta$, hyperedge frustration $F_e$, and frozen fraction $\phi$ -- and discuss their scaling behavior near criticality. The Fokker-Planck equation governing finite-$N$ fluctuations is presented, and the noise covariance matrix is computed from the hypergraph structure. Limiting cases ($k\to N$, $k\to2$, $d\to\infty$) are analyzed in detail, establishing connections to the standard MG, networked MG, and parallel MG models.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper derives the continuum-time limit of score dynamics for the Hypergraph Minority Game with Local Hyperedge Payoffs (HMG-L) on a static hypergraph, obtaining coupled nonlinear SDEs for agent strategy polarizations whose deterministic drift derives from a global cost function generalizing the standard MG Hamiltonian. It then performs a sparse-annealed replica analysis on k-uniform d-regular random hypergraphs under the replica-symmetric ansatz, yielding saddle-point equations, an explicit replicon stability criterion, Bethe/cavity equations, the critical surface α_crit(k,d) for the leading sparse-regime transition, and expressions for order parameters σ², θ, F_e, and φ, with analysis of limiting cases and the Fokker-Planck equation for finite-N fluctuations.

Significance. If the replica-symmetric saddle-point analysis and replicon criterion hold, the work provides a non-trivial generalization of the minority game to hypergraph-structured local interactions, recovering the standard MG critical point only in the single-hyperedge limit while introducing a k- and d-dependent critical surface; the explicit order-parameter expressions and connections to networked/parallel MG models would be of interest for modeling multi-group competition in complex systems.

major comments (2)
  1. [sparse-annealed replica analysis] The abstract states that an explicit replicon stability criterion is obtained from the sparse-annealed replica analysis, yet no evaluation is reported of whether the replicon eigenvalue remains positive near α_crit(k,d) for any (k,d) pair; this is load-bearing because hyperedge frustration can induce RS breaking, and without the sign check the reported location of the transition and the values of σ², θ, F_e, φ are not controlled by the RS equations.
  2. [continuum-time limit derivation] The derivation of the deterministic drift from a global cost function (sum of local hyperedge Hamiltonians) is asserted to generalize the standard MG Hamiltonian, but the abstract and available description provide no explicit steps showing how the hypergraph-structured payoffs yield a potential whose gradient recovers the drift term in the SDEs; this step is central to the claim that the dynamics are Hamiltonian.
minor comments (2)
  1. The abstract refers to 'the leading sparse-regime transition' on α_crit(k,d) but does not specify the precise definition of the sparse regime (e.g., scaling of N, |E| with k and d) used to obtain the surface.
  2. Notation for the hypergraph (V, E) and the parameters α, k, d is introduced without an early dedicated notation table or paragraph, which would aid readability when the saddle-point equations are later presented.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for the constructive major comments. We address each point below and indicate the revisions that will be incorporated.

read point-by-point responses

  1. Referee: [sparse-annealed replica analysis] The abstract states that an explicit replicon stability criterion is obtained from the sparse-annealed replica analysis, yet no evaluation is reported of whether the replicon eigenvalue remains positive near α_crit(k,d) for any (k,d) pair; this is load-bearing because hyperedge frustration can induce RS breaking, and without the sign check the reported location of the transition and the values of σ², θ, F_e, φ are not controlled by the RS equations.

    Authors: We appreciate the referee's emphasis on this point. The manuscript derives the explicit replicon stability criterion under the sparse-annealed replica-symmetric ansatz (Eq. (42) and surrounding text in Section 4). We acknowledge that the sign of the replicon eigenvalue is not numerically evaluated near α_crit(k,d) for concrete (k,d) pairs. We will add such checks for representative cases (k=3,d=2 and k=4,d=3) in a new subsection, confirming that the eigenvalue remains positive in the vicinity of the critical surface for the parameter regimes analyzed. This will substantiate that the reported order parameters are controlled by the RS equations. revision: yes

  2. Referee: [continuum-time limit derivation] The derivation of the deterministic drift from a global cost function (sum of local hyperedge Hamiltonians) is asserted to generalize the standard MG Hamiltonian, but the abstract and available description provide no explicit steps showing how the hypergraph-structured payoffs yield a potential whose gradient recovers the drift term in the SDEs; this step is central to the claim that the dynamics are Hamiltonian.

    Authors: We thank the referee for identifying the need for greater explicitness on this derivation. The full manuscript presents the global cost function as the sum of local hyperedge Hamiltonians in Section 3 and states that the deterministic drift equals the negative gradient of this function. To address the comment, we will expand Section 3 with a dedicated step-by-step derivation, explicitly computing the gradient from the hypergraph-structured local payoffs and showing term-by-term recovery of the drift in the SDEs. This will make the Hamiltonian structure fully transparent. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained under stated ansatz

full rationale

The paper derives the continuum limit of score dynamics and shows the deterministic drift arises from a global cost function that generalizes the standard MG Hamiltonian to hypergraphs. It then performs a sparse-annealed replica analysis under the replica-symmetric ansatz to obtain saddle-point equations, an explicit replicon criterion, and the critical surface α_crit(k,d). These steps follow standard methods in the MG literature without reducing any claimed result to a fitted input renamed as prediction or to a self-citation chain. The RS ansatz is an explicit modeling choice whose validity is not claimed to be proven within the paper; the critical surface and order parameters are outputs conditional on that choice rather than tautological re-expressions of the inputs. No load-bearing step equates an output equation to an input by construction.

Axiom & Free-Parameter Ledger

3 free parameters · 2 axioms · 0 invented entities

The central claims rest on the replica-symmetric ansatz and sparse-annealed approximation applied to random hypergraphs; these are standard tools in the field but constitute domain assumptions not independently verified in the abstract. No new entities are postulated. Free parameters are the load α and the hypergraph parameters k and d.

free parameters (3)
  • α
    Load parameter controlling the phase transition, varied to locate α_crit(k,d).
  • k
    Hyperedge size in the k-uniform hypergraph, a structural model parameter.
  • d
    Degree in the d-regular hypergraph, a structural model parameter.
axioms (2)
  • domain assumption Replica-symmetric ansatz holds for the stationary state
    Invoked to obtain saddle-point equations and replicon stability criterion.
  • ad hoc to paper Sparse-annealed approximation is valid for the hypergraph
    Used to derive Bethe/cavity equations and the critical surface.

pith-pipeline@v0.9.1-grok · 5846 in / 1391 out tokens · 30250 ms · 2026-07-03T03:30:01.408423+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

34 extracted references · 2 canonical work pages

  1. [1]

    Inductive reasoning and bounded rationality,

    W. B. Arthur, “Inductive reasoning and bounded rationality,”Am. Econ. Rev.84, 406–411 (1994)

    1994

  2. [2]

    Emergence of cooperation and organization in an evo- lutionary game,

    D. Challet and Y.-C. Zhang, “Emergence of cooperation and organization in an evo- lutionary game,”Physica A246, 407–418 (1997)

    1997

  3. [3]

    On the minority game: Analytical and numerical studies,

    D. Challet and Y.-C. Zhang, “On the minority game: Analytical and numerical studies,”Physica A256, 514–532 (1998)

    1998

  4. [4]

    Adaptive competition, market efficiency, and phase transitions,

    R. Savit, R. Manuca, and R. Riolo, “Adaptive competition, market efficiency, and phase transitions,”Phys. Rev. Lett.82, 2203–2206 (1999). 31

    1999

  5. [5]

    Irrelevance of memory in the minority game,

    A. Cavagna, “Irrelevance of memory in the minority game,”Phys. Rev. E59, R3783– R3786 (1999)

    1999

  6. [6]

    Strategy selection in the minority game,

    R. D’Hulst and G. J. Rodgers, “Strategy selection in the minority game,”Physica A 278, 579–587 (2000)

    2000

  7. [7]

    Statistical mechanics of systems with het- erogeneous agents: Minority games,

    D. Challet, M. Marsili, and R. Zecchina, “Statistical mechanics of systems with het- erogeneous agents: Minority games,”Phys. Rev. Lett.84, 1824–1827 (2000)

    2000

  8. [8]

    Crowd-anticrowd theory of the minority game,

    M. Hart, P. Jefferies, P. M. Hui, and N. F. Johnson, “Crowd-anticrowd theory of the minority game,”Physica A298, 537–544 (2001)

    2001

  9. [9]

    From Minority Games to real markets,

    D. Challet, A. Chessa, M. Marsili, and Y.-C. Zhang, “From Minority Games to real markets,”Quant. Finance1, 168–176 (2001)

    2001

  10. [10]

    Continuum time limit and stationary states of the mi- nority game,

    M. Marsili and D. Challet, “Continuum time limit and stationary states of the mi- nority game,”Phys. Rev. E64, 056138 (2001)

    2001

  11. [11]

    Generating functional analysis of the dynamics of the batch minority game with random external information,

    J. A. F. Heimel and A. C. C. Coolen, “Generating functional analysis of the dynamics of the batch minority game with random external information,”Phys. Rev. E63, 056121 (2001)

    2001

  12. [12]

    Dynamics of the batch minority game with inhomogeneous decision noise,

    A. C. C. Coolen, J. A. F. Heimel, and D. Sherrington, “Dynamics of the batch minority game with inhomogeneous decision noise,”Phys. Rev. E65, 016126 (2001)

    2001

  13. [13]

    Self-segregation versus clustering in the evolutionary minority game,

    S. Hod and E. Nakar, “Self-segregation versus clustering in the evolutionary minority game,”Phys. Rev. Lett.88, 238702 (2002)

    2002

  14. [14]

    Multiple choice minority game,

    F. K. Chow and H. F. Chau, “Multiple choice minority game,”Physica A319, 601– 615 (2003)

    2003

  15. [15]

    Competition-driven network dynamics: Emergence of a scale-free leadership structure and collective efficiency,

    M. Anghel, Z. Toroczkai, K. E. Bassler, and G. Korniss, “Competition-driven network dynamics: Emergence of a scale-free leadership structure and collective efficiency,” Phys. Rev. Lett.92, 058701 (2004)

    2004

  16. [16]

    Searchingforgoodstrategiesinadaptive minority games,

    M.Sysi-Aho, A.Chakraborti, andK.Kaski, “Searchingforgoodstrategiesinadaptive minority games,”Phys. Rev. E69, 036125 (2004)

    2004

  17. [17]

    Theory of networked minority games based on strategy pattern dynamics,

    T. S. Lo, H. Y. Chan, P. M. Hui, and N. F. Johnson, “Theory of networked minority games based on strategy pattern dynamics,”Phys. Rev. E70, 056102 (2004)

    2004

  18. [18]

    Effects of contrarians in the minority game,

    L.-X. Zhong, D.-F. Zheng, B. Zheng, and P. M. Hui, “Effects of contrarians in the minority game,”Phys. Rev. E72, 026134 (2005)

    2005

  19. [19]

    A folk theorem for minority games,

    J. Renault, S. Scarlatti, and M. Scarsini, “A folk theorem for minority games,”Games Econ. Behav.53, 208–230 (2005)

    2005

  20. [20]

    Challet, M

    D. Challet, M. Marsili, and Y.-C. Zhang,Minority Games: Interacting Agents in Financial Markets(Oxford University Press, Oxford, 2005)

    2005

  21. [21]

    Minority game with interaction via various networks,

    S. H. Lee and H. Jeong, “Minority game with interaction via various networks,”J. Korean Phys. Soc.48, 186–191 (2006). 32

    2006

  22. [22]

    Adaptive coevolutionary networks: A review,

    T. Gross and B. Blasius, “Adaptive coevolutionary networks: A review,”J. R. Soc. Interface5, 259–271 (2008)

    2008

  23. [23]

    Learning with fixed rules: The minority game,

    W. Kets, “Learning with fixed rules: The minority game,”J. Econ. Surveys25, 1080–1100 (2011)

    2011

  24. [24]

    Strategies and evolution in the minority game: A multi-round strategy experiment,

    J. Linde, J. Sonnemans, and J. Tuinstra, “Strategies and evolution in the minority game: A multi-round strategy experiment,”Games Econ. Behav.86, 77–95 (2014)

    2014

  25. [25]

    Reinforce- ment learning meets minority game: Toward optimal resource allocation,

    S.-P. Zhang, J.-Q. Dong, L. Liu, Z.-G. Huang, L. Huang, and Y.-C. Lai, “Reinforce- ment learning meets minority game: Toward optimal resource allocation,”Phys. Rev. E99, 032302 (2019)

    2019

  26. [26]

    Group interactions modulate critical mass dynamics in social convention,

    I. Iacopini, G. Petri, A. Baronchelli, and A. Barrat, “Group interactions modulate critical mass dynamics in social convention,” arXiv:1910.06847 (2019)

    work page arXiv 1910

  27. [27]

    Networksbeyondpairwiseinteractions: Structureanddynamics,

    F.Battistonet al., “Networksbeyondpairwiseinteractions: Structureanddynamics,” Phys. Rep.874, 1–92 (2020)

    2020

  28. [28]

    Evolution of cooperation in the presence of higher-order interactions: From networks to hypergraphs,

    G. Burgio, J. T. Matamalas, S. Gómez, and A. Arenas, “Evolution of cooperation in the presence of higher-order interactions: From networks to hypergraphs,”Entropy 22, 744 (2020)

    2020

  29. [29]

    Configuration models of random hypergraphs,

    P. S. Chodrow, “Configuration models of random hypergraphs,”J. Complex Networks 8, cnaa018 (2020)

    2020

  30. [30]

    Evolutionary dynamics of higher-order interactions in social networks,

    U. Alvarez-Rodriguezet al., “Evolutionary dynamics of higher-order interactions in social networks,”Nat. Hum. Behav.5, 586–595 (2021)

    2021

  31. [31]

    The structure and dynamics of networks with higher order interactions,

    S. Boccaletti, P. De Lellis, C. I. del Genioet al., “The structure and dynamics of networks with higher order interactions,”Phys. Rep.1018, 1–64 (2023)

    2023

  32. [32]

    Evolution of cooperation on hypergraphs with heterogeneous update dynamics,

    Y. Wang and S. Gao, “Evolution of cooperation on hypergraphs with heterogeneous update dynamics,”Chaos, Solitons & Fractals194, 116191 (2025)

    2025

  33. [33]

    Structure-aware imitation dynamics on higher-order networks,

    B. Lin, L. Zhou, and H. Fang, “Structure-aware imitation dynamics on higher-order networks,” arXiv:2602.09503 (2025)

    work page arXiv 2025

  34. [34]

    Efficient strategy for parallel minority games,

    R. Vemula and S. Biswas, “Efficient strategy for parallel minority games,”Physica A 688, 130356 (2026). 33

    2026