{"id":"33430dca-40fb-45c0-b6cd-289e6b993047","arxiv_id":"2506.11468","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For a linear-quadratic nonzero-sum game between two graphon teams, the paper derives a Nash equilibrium from coupled Riccati equations and proves existence for sufficiently small cross-team coupling.","lead":"This paper analyzes a game between two large teams whose members interact through graphon networks, with random noise and quadratic costs. It derives a Nash equilibrium from coupled operator-valued Riccati equations and proves these equations have solutions when the cross-team coupling is small.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The small-coupling existence proof (Thm 3.2) applies to the single operator equation (12), but the asserted equivalence of (12) with the coupled system (10) that actually defines the Nash equilibrium is unproved and not reproducible from the displayed block definitions; under the natural…","rationale":"The reader correctly notes the missing reference [47] for well-posedness of (4), but the more load-bearing point is the gap between (10) and (12). The existence of solutions of (12) is what Theorem 3.2 actually establishes; if the reduction to (10) fails, the feedback Nash equilibrium in Theorem 2.1 is not justified for small coupling. My own expansion of the natural block interpretations suggests the quadratic terms may not match, which would be a substantive error rather than a missing citation. However, I cannot rule out that the authors intended a different block structure, so the issue is settled by the proposed finite-dimensional check. This reinforces rather than overturns the Reader's CONDITIONAL verdict: the paper should be accepted only after the (10)-(12) equivalence is either proved explicitly, with precise block definitions, or corrected; if the check shows a mismatch, the correct disposition would move toward REJECT. The omitted proof of Theorem 3.1 is less central because the small-coupling result does not rely on it, and the SDE well-posedness gap is standard and fixable.","tokens_in":12519,"tokens_out":25923,"duration_ms":248701,"concrete_test":"Discretize the problem to finite dimension N (replace L2[0,1] by R^N and graphon operators by symmetric N×N matrices), implement the finite-dimensional version of the coupled system (10) and the finite-dimensional version of (12) using the Section 3 block definitions literally (PI=diag(PI1,PI2), Kepsilon=diag(Aepsilon,Aepsilon), S=diag(S1,S2), J=swap, and the displayed S0), and integrate both backward from the same terminal data with random symmetric M1,M2, Bi=Ri=1, nonzero Gamma, epsilon=0 and epsilon=0.1. If the two trajectories differ beyond the ODE solver tolerance, the asserted reduction is false; if they agree to tolerance, run the same test with a nonzero epsilon inside the claimed interval to verify the epsilon-term in (12) reproduces (10).","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central existence claim, Theorem 3.2, is proved only for the single operator equation (12), while the Nash equilibrium in Theorem 2.1 is built from solutions of the coupled system (10). The text says 'Clearly, we can check' and gives no derivation of the equivalence. The definitions of K_epsilon, S, S_0, J, Qbar, and G use column/block notation that is never reconciled with the products PI K_epsilon, PI S PI, PI J S PI J, and J PI S J PI in (12). With the natural reading PI=diag(PI1,PI2), K_epsilon=diag(A_epsilon,A_epsilon), S=diag(2/R11 B1B1*, 2/R22 B2B2*), and J the swap on H2⊕H2, the quadratic part of (12) at epsilon=0 has (1,1)-block -PI1 S1 PI1 - PI1 S2 PI1 - PI2 S2 PI1, whereas (10) requires -PI1 S1 PI1 - PI1 S2 PI2 - PI2 S2 PI1. These agree only under an extra condition such as S2 PI1 = S2 PI2, which is not generally true. If the intended block structure is different, the paper does not state it. Since Theorem 3.2 is the only argument that a solution of (10) exists for small |epsilon|, an incorrect or unverifiable reduction leaves the main equilibrium theorem without proof. Secondary gaps include the nonexistent reference [47] for well-posedness of (4) and the omitted proof of Theorem 3.1; these are less load-bearing because the small-|epsilon| route does not depend on Theorem 3.1 and the SDE well-posedness is a standard result that can be supplied by citation.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies a finite-horizon linear-quadratic nonzero-sum stochastic differential game between two teams of interacting agents, with intrateam interactions described by graphon operators. The authors reformulate the two-team problem as an infinite-dimensional two-player game, derive coupled operator-valued Riccati-type equations (10) from a dynamic programming verification theorem, and then prove small-coupling existence of solutions to a single operator Riccati equation (12). From this they conclude the existence of a feedback Nash equilibrium for the original game. The main novelty is the continuous-time two-team graphon setting and the perturbation argument for the coupled Riccati system.","tokens_in":12863,"tokens_out":23337,"duration_ms":238139,"significance":"If the connection between the coupled system (10) and the single operator equation (12) is made fully rigorous, the paper is a meaningful contribution to graphon games and infinite-dimensional stochastic differential games: it is, to the authors' knowledge, the first continuous-time treatment of nonzero-sum team-against-team games with heterogeneous intrateam interactions. The Banach-space perturbation theorem (Theorem 3.3) is proved in detail, the epsilon=0 base case is constructed from classical Riccati theory rather than assumed, and no parameters are fitted, so the existence argument is not circular. The contribution is moderately significant and fits the journal's scope, but the current presentation leaves the central reduction between the two Riccati formulations unverified.","major_comments":[{"comment":"The reduction from the coupled system (10) to the single operator equation (12) is asserted with \"Clearly, we can check\" but is never shown. The displayed definitions are not self-consistent as written: K_epsilon, S, S0, I_{2x2}, J, Qbar, and G are written as column vectors, and as written they do not define elements of L(H4) without an implicit diagonal convention. If the intended convention is that a column (X;Y) denotes the block-diagonal operator diag(X,Y) and that J is the swap on H2 oplus H2, then a direct block computation does reproduce the quadratic and epsilon-coupling terms of (10); in particular the (1,1)-block at epsilon=0 is -Pi1 S1 Pi1 - Pi1 S2 Pi2 - Pi2 S2 Pi1, which matches the first line of (10). However, this convention is never stated, and no derivation of the equivalence is given. Since Theorem 3.2 is proved only for (12) while Theorem 2.1 is stated for (10), the main existence claim depends on this unstated and unverified reduction. Please state the block conventions explicitly and provide the full verification of the equivalence.","section":"Section 3, Eq. (12) and preceding displayed definitions"},{"comment":"The existence and uniqueness of a strong (mild) solution to the stochastic evolution equation (4) is asserted by reference to \"[47, Th.3.14]\", but no reference [47] appears in the bibliography. The Itô-formula computations in (5)-(7) and the verification theorem depend on the well-posedness of the state equation. Please supply a correct citation with the precise hypotheses, or include a short proof adapted to the present setting.","section":"Section 2, after Eq. (4)"},{"comment":"Theorem 3.1 is stated as a local existence result for (12) at epsilon=1, but its proof is omitted with the sentence \"The proof is similar to the one of [19, Th 2.1] and so we omit it here.\" Since this is one of the paper's stated existence results, the reader cannot check whether the cited theorem applies to the operator Riccati equation. If Theorem 3.1 is not needed for the main small-coupling argument, this should be stated explicitly and the claim should be proved or moved to a remark; otherwise a full proof is required.","section":"Section 3, Theorem 3.1"}],"minor_comments":[{"comment":"The noise coefficient Sigma is displayed as a column (sigma1 I; sigma2 I), but in (4) it must act as the block-diagonal operator diag(sigma1 I, sigma2 I) on the H2-valued Wiener process; please clarify the intended block-matrix convention.","section":"Section 2, Eq. (4)"},{"comment":"The symbol D is used both for the Banach space of block-diagonal operators in Lemma 3.1 and for the solution domain in Theorem 3.3; please rename one of them to avoid ambiguity.","section":"Section 3, Lemma 3.1 and Theorem 3.3"},{"comment":"The expectation of the Itô integral is dropped without comment; please add a remark on the integrability of the stochastic integral or a localization argument to justify the martingale property.","section":"Section 2, Eq. (5)"},{"comment":"The conditions are written as \"0 = ... <= ...\", which conflates the HJB equality at the equilibrium strategy with the inequality for arbitrary controls; separating these two statements would improve readability.","section":"Proposition 2.1, conditions (iii)-(iv)"},{"comment":"There is a typo \"hetergeneous\" that should be \"heterogeneous\", and the 2020 Mathematics Subject Classification field is left blank.","section":"Introduction and metadata"}],"recommendation":"major_revision","confidential_remarks":"The mathematical substance appears defensible once the block-operator notation is clarified and the reduction between (10) and (12) is written out. I do not see grounds for questioning novelty or author conduct; the main risk is purely technical reproducibility. No numerical experiments are needed for this theoretical contribution."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The setting is new: continuous-time nonzero-sum LQ game between two graphon teams, solved by dynamic programming into coupled operator Riccati equations, with existence via a small-epsilon perturbation argument. The paper is honest about what it does, cites the relevant discrete-time and zero-sum precedents, and proves the perturbation theorem (Thm 3.3) in full detail. Credit is due for the formal setup and for isolating the right base case at epsilon = 0.\n\nThe soft spot is load-bearing. The Nash equilibrium in Theorem 2.1 is defined by the coupled system (10), but the existence proof, Theorem 3.2, proves existence only for the single operator equation (12). The paper says \"Clearly, we can check\" and gives block definitions that are never reconciled with the products in (12). On the natural reading of the definitions, the quadratic terms do not match: the (1,1) block at epsilon = 0 contains -Π1 S1 Π1 - Π1 S2 Π1 - Π2 S2 Π1, while (10) requires -Π1 S1 Π1 - Π1 S2 Π2 - Π2 S2 Π1. These agree only under an extra condition like S2 Π1 = S2 Π2. If the intended block structure is different, it is not stated. Since Theorem 3.2 is the only existence argument for (10), the main theorem is currently unproved. This is fixable if the reduction can be made correct, but it is not a cosmetic issue.\n\nOther gaps: well-posedness of the Hilbert SDE (4) cites [47], which is not in the bibliography; Theorem 3.1's proof is omitted, though it is local and not used for the main small-epsilon claim. These are minor beside the equivalence problem.\n\nBottom line: the problem is worth solving and the machinery is standard. As it stands, the paper needs a correct, explicit derivation of (12) from (10) before the main result can be trusted. I would send it to a referee—the setting is novel and the gap is narrow—but the referee should be asked to verify the block calculation and the reduction step.","headline":"Novel two-team graphon game setting, but the main existence theorem currently rests on an unverified equivalence between the coupled Riccati system and the operator equation that is actually solved.","tokens_in":13424,"tokens_out":2023,"would_cite":false,"duration_ms":20779,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["91A23","91A15","93E20","49N10","60H15"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper establishes that a nonzero-sum stochastic game between two graphon-interacting teams has a feedback Nash equilibrium whenever a coupled pair of operator-valued Riccati equations admits a solution, and proves such solutions…","keywords":["stochastic differential games","graphon","Nash equilibrium","operator-valued Riccati equations","dynamic programming","infinite-dimensional stochastic control","linear-quadratic games","nonzero-sum games"],"falsifier":"Take two non-identical graphons with non-commuting operators, choose a nonzero but small $\\epsilon$, and solve the coupled Riccati system (10) on $[0,T]$ after projecting onto a finite basis of $L^2[0,1]$. If the smallness hypotheses of Theorem 3.2 hold and yet no finite-dimensional solution reaches $t=0$, the perturbation theorem is wrong; if a solution does reach $t=0$, compare the implied feedback laws against the original continuum dynamics to test the Nash property and the missing well-posedness step.","tokens_in":12248,"feed_emoji":"🎮","tokens_out":11694,"duration_ms":112406,"temperature":0.7,"pith_summary":"The paper studies a nonzero-sum stochastic differential game in which two large teams of agents, each internally coupled through graphons (symmetric kernels on $[0,1]^2$ that encode interaction strengths), choose controls to minimize their own social costs. It establishes that the continuum team game is exactly an infinite-dimensional two-agent game, and then derives a feedback Nash equilibrium in the form $\\bar u_i(t)=-(2/R_{ii})B_i^*\\Pi_i(t)x_t$, where the operators $\\Pi_1,\\Pi_2$ solve a coupled operator-valued Riccati system. The main existence theorem states that this Riccati system has a solution on the whole time horizon whenever the inter-team coupling parameter is sufficiently small, and a local solution for full coupling. A sympathetic reader should care because this gives a concrete path from heterogeneous many-agent team competition to a small set of operator equations whose solutions directly yield equilibrium strategies and costs.","feed_headline":"Coupled Riccati equations solve two-team graphon Nash games","feed_subtitle":"For small inter-team coupling, explicit feedback strategies exist for continuum teams with heterogeneous interactions.","key_machinery":"The central machinery is the graphon operator $(T_M\\varphi)(\\alpha)=\\int_0^1 M(\\alpha,\\beta)\\varphi(\\beta)d\\beta$, which is self-adjoint and compact on $L^2[0,1]$. It converts the continuum dynamics (1) into the Hilbert-space stochastic evolution (4) on $H^2=L^2[0,1]^2$, making the two-team game equivalent to an infinite-dimensional two-agent linear-quadratic game. Dynamic programming then transforms the Nash conditions into the coupled operator Riccati equations (10); the existence proof rewrites these as the single nonlinear operator equation (12) in the Banach space $D$ of block-diagonal self-adjoint operators, proves local solvability by a contraction argument, and uses a perturbation theorem from the decoupled case $\\epsilon=0$ to extend to small $\\epsilon$.","core_discovery":"The central claim, on the paper's own terms, is that Problem 1.1 admits a feedback Nash equilibrium for two graphon-interacting teams whenever the coupled operator-valued Riccati-type equations (10) have a solution. The paper proves such a solution exists on all of $[0,T]$ for every sufficiently small coupling $|\\epsilon|$ (Theorem 3.2) and on a short interval near the terminal time even when $\\epsilon=1$ (Theorem 3.1). At $\\epsilon=0$ the coupled system splits into two independent operator Riccati equations, one per team, and the perturbation theorem Theorem 3.3 carries this solution to nonzero small $\\epsilon$. Thus the paper's two-team Nash game is solved by reducing it to a solvable pair of operator equations.","pith_inferences":["An extension the authors leave implicit is spectral truncation: because graphon operators are compact, expanding states in their eigenbases turns the coupled operator equations (10) into a finite system of Riccati ODEs, giving a numerical route to test the theorem.","The same perturbation argument should extend to small heterogeneity in the graphons themselves, not only small cross-team coupling, since the contraction estimates depend on operator norms rather than on the specific kernels.","The missing well-posedness lemma is the main bridge between the formal Riccati derivation and a fully rigorous theorem; supplying a proof of unique mild solutions of (4) and the required Itô formula interchange would complete the paper's program."],"forward_implications":["For $|\\epsilon|$ small enough, Theorem 3.2 gives an equilibrium in feedback form, so each team's optimal control at time $t$ depends only on the current aggregate state through the operator $\\Pi_i(t)$.","The value functions are quadratic, $J_i=\\langle\\Pi_i(0)x_0,x_0\\rangle_{H^2}+q_i(0)$, so the equilibrium payoffs are computable from the same operator pair.","At $\\epsilon=0$ the coupled system decouples into two independent operator Riccati equations, recovering single-population graphon linear-quadratic control as the zero-coupling limit.","Theorem 3.1 provides a local-in-time solution near $T$ even at full coupling $\\epsilon=1$, so the feedback-equilibrium construction is not restricted to weak inter-team coupling near the terminal time."],"supporting_citations":[{"why":"It supplies the graphon operator $T_M$ and its self-adjoint compactness, used to reformulate the continuum dynamics as an evolution equation in $L^2[0,1]$.","marker":"[16]"},{"why":"It supplies the verification-lemma argument adapted as Proposition 2.1, which gives sufficient conditions for a two-team Nash equilibrium.","marker":"[17]"},{"why":"It supplies the continuous-dependence-on-parameters theorem extended as Theorem 3.3, the bridge from $\\epsilon=0$ to small $\\epsilon$.","marker":"[18]"},{"why":"It supplies the local-existence and continuation results for nonlinear operator equations invoked in Theorems 3.1 and 3.3.","marker":"[19]"},{"why":"It supplies existence and uniqueness for the decoupled operator Riccati equations at $\\epsilon=0$, the base case of the perturbation argument.","marker":"[20]"}],"fun_headline_variants":["Two-team graphon Nash games solved via coupled Riccati equations","Graphon team games: Nash equilibrium from coupled Riccati","Coupled Riccati yields Nash for two graphon teams","Explicit feedback Nash strategies for graphon team games"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The derivation depends on the unproved assertion that the infinite-dimensional stochastic evolution (4) admits a unique strong solution and that the Itô formula used in the verification argument is valid; the paper refers to a theorem [47] for this, but that reference is absent from the bibliography.","fun_headline_variants_meta":{"raw":{"variants":["Two-team graphon Nash games solved via coupled Riccati equations","Graphon team games: Nash equilibrium from coupled Riccati","Coupled Riccati yields Nash for two graphon teams","Explicit feedback Nash strategies for graphon team games"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000562,"raw_usage":{"total_tokens":2596,"prompt_tokens":803,"completion_tokens":1793,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":419,"completion_tokens_details":{"reasoning_tokens":1723}},"tokens_in":419,"tokens_out":1793,"duration_ms":13844,"temperature":1.0,"reasoning_tokens":1723,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T04:05:59.490711+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take two non-identical graphons with non-commuting operators, choose a nonzero but small $\\epsilon$, and solve the coupled Riccati system (10) on $[0,T]$ after projecting onto a finite basis of $L^2[0,1]$. If the smallness hypotheses of Theorem 3.2 hold and yet no finite-dimensional solution reaches $t=0$, the perturbation theorem is wrong; if a solution does reach $t=0$, compare the implied feedback laws against the original continuum dynamics to test the Nash property and the missing well-posedness step.","supporting_citations":[{"cited_title":"Lov´ asz, Large Networks and Graph Limits, vol","cited_arxiv_id":null,"evidence_quote":"It supplies the graphon operator $T_M$ and its self-adjoint compactness, used to reformulate the continuum dynamics as an evolution equation in $L^2[0,1]$."},{"cited_title":"Ichikawa, Dynamic programming approach to stochastic evolution equations, SIAM Journal on Con- trol and Optimization, 17:152-174, 1979","cited_arxiv_id":null,"evidence_quote":"It supplies the verification-lemma argument adapted as Proposition 2.1, which gives sufficient conditions for a two-team Nash equilibrium."},{"cited_title":"Tikhonov, A.B","cited_arxiv_id":null,"evidence_quote":"It supplies the continuous-dependence-on-parameters theorem extended as Theorem 3.3, the bridge from $\\epsilon=0$ to small $\\epsilon$."},{"cited_title":"Guo, Nonlinear functional analysis, 2nd ed, (in Chinese), Ji’nan: Shandong Science and Technology Press, 2001","cited_arxiv_id":null,"evidence_quote":"It supplies the local-existence and continuation results for nonlinear operator equations invoked in Theorems 3.1 and 3.3."},{"cited_title":"Bensoussan, G","cited_arxiv_id":null,"evidence_quote":"It supplies existence and uniqueness for the decoupled operator Riccati equations at $\\epsilon=0$, the base case of the perturbation argument."}],"review_version":1}