Uniform-horizon convergence from the Nash system
LLM status Open unverified
C73 — Stochastic and Dynamic Games - Evolutionary Games - Repeated Games Economics catalogue openaigpt 6 astra ultra 20% cataloguednot recordedOpenStatement
GT-078 | Mean-field games | R: precise instantiation of a published question; review required
Definitions and mathematical statement
Let $\mathbb T^d=\mathbb R^d/\mathbb Z^d$ have normalized Lebesgue measure, and let $\mathcal P(\mathbb T^d)$ denote its Borel probability measures. Fix couplings $F,G:\mathbb T^d\times\mathcal P(\mathbb T^d)\to\mathbb R$ that are smooth and Lasry--Lions monotone: \[ \int_{\mathbb T^d}[K(x,m)-K(x,m')](m-m')(dx)\geq0, \qquad K\in\{F,G\},\quad m,m'\in\mathcal P(\mathbb T^d). \] For a concrete smooth class, require continuous flat functional derivatives through order four, jointly $C^6$ with bounded spatial derivatives in all their spatial arguments. A first flat derivative $\delta K/\delta m$ means \[ \left.\frac d{d\theta}K(x,(1-\theta)m+\theta m')\right|_{\theta=0^+} =\int\frac{\delta K}{\delta m}(x,m,y)(m'-m)(dy); \] higher derivatives are defined recursively. Assume the classical solutions specified below exist for each horizon $T>0$.For $N\geq2$, $\boldsymbol x=(x_1,\ldots,x_N)$ and $m^{N,i}_{\boldsymbol x}=(N-1)^{-1}\sum_{j\ne i}\delta_{x_j}$, let $v^{N,T,i}$ solve the no-common-noise Nash system \[ \begin{split} -\partial_t v^{N,T,i}-\sum_{j=1}^N\Delta_{x_j}v^{N,T,i} +\tfrac12|D_{x_i}v^{N,T,i}|^2 +\sum_{j\ne i}D_{x_j}v^{N,T,i}\cdot D_{x_j}v^{N,T,j} &=F(x_i,m^{N,i}_{\boldsymbol x}),\\ v^{N,T,i}(T,\boldsymbol x)&=G(x_i,m^{N,i}_{\boldsymbol x}). \end{split} \] Define $U^T(t,x,m)$ as the representative player's value in the unique monotone MFG equilibrium on $[t,T]$ with population law $m$ at time $t$. Its optimal-control dynamics are $dX_s=\alpha_s ds+\sqrt2\,dB_s$, and its cost is \[ \mathbb E\!\left[\int_t^T\left(\tfrac12|\alpha_s|^2+F(X_s,m_s)\right)ds +G(X_T,m_T)\right],\qquad X_t=x. \] Here $(m_s)$ is the equilibrium population flow starting from $m$, kept fixed in the representative player's optimization. This characteristic definition specifies the master-equation solution and its terminal condition $U^T(T,x,m)=G(x,m)$.
For a function $f(\boldsymbol x)$ set \[ \mathcal C_i f(\boldsymbol x)=f(\boldsymbol x)-\int_{\mathbb T^d}f(x_1,\ldots,z,\ldots,x_N)dz, \quad \mathcal C U^T(t,x,m)=U^T(t,x,m)-\int U^T(t,z,m)dz. \] The following norm choice is editorial. Determine whether \[ \lim_{N\to\infty}\sup_{T>0}\max_{1\leq i\leq N} \sup_{(t,\boldsymbol x)\in[0,T]\times(\mathbb T^d)^N} \begin{aligned}[t] \big(&|\mathcal C_i v^{N,T,i}(t,\boldsymbol x) -\mathcal C U^T(t,x_i,m^{N,i}_{\boldsymbol x})|\\[-2pt] &+|D_{x_i}v^{N,T,i}(t,\boldsymbol x) -D_xU^T(t,x_i,m^{N,i}_{\boldsymbol x})|\big)=0. \end{aligned} \] If these assumptions do not suffice, identify the additional quantitative stability hypothesis needed for this estimate.
Short English statement
Can the finite-player feedbacks and centered values approximate the MFG values with an error independent of the time horizon?Variants and scope boundaries
An uncentered value estimate uniform over all horizons is a stronger question: a small error in an ergodic cost may accumulate linearly in $T$. Convergence of empirical trajectories, estimates only away from terminal time, and a common-noise version have different quantifiers and norms.Source relationship and status
The source asks for convergence uniform in time; the centered norm and smooth class here are editorial specifications. Its source-date open status is not an exhaustive 2026 literature certificate.References
[S1] Pierre Cardaliaguet and François Delarue (2023). Selected topics in mean field games. Proceedings of the International Congress of Mathematicians 2022, vol. 5, pp. 3660--3703, EMS Press; DOI: 10.4171/ICM2022/17. The volume was published on 15 December 2023; the chapter carries 2022 copyright.
Locators: Nash system (1.1), p. 3663; master equation (2.3); Section 3.2, final paragraph, p. 3680, uniform-time convergence question.
https://ems.press/content/book-chapter-files/33265
Common conventions: Source mathematical conventions
Finite games. For a finite set $A$, $\Delta(A)$ is its probability simplex. Players choose independent mixed strategies in Nash equilibrium; correlation is allowed only when explicitly part of the solution concept. In a game with payoff functions $u_i$ and strategy profile $x$, an additive $\varepsilon$ Nash equilibrium satisfies \[ u_i(x)\geq u_i(x_i',x_{-i})-\varepsilon \quad\text{for every player $i$ and every admissible deviation $x_i'$}. \] For numerical approximation, payoffs are normalized as locally specified. An $\varepsilon$ payoff residual is distinct from distance at most $\varepsilon$ to the set of exact equilibria. Point convergence, convergence of empirical play, and convergence in distance to an equilibrium set are also distinct.
Computational representations. Unless stated otherwise, a complexity question takes rational data with binary encoding; polynomial time is measured in total bit length. A fixed-accuracy polynomial algorithm is not necessarily polynomial in $1/\varepsilon$, and neither is necessarily polynomial in $\log(1/\varepsilon)$. Succinct games and value, demand, or sampling oracles must declare their interfaces. Exact real solutions require an explicit representation; an unspecified list of arbitrary real numbers is not a finite computational output. A claimed algorithmic barrier is meaningful only for its specified model and reductions.
Dynamic games. Histories, information, observation, and allowable randomization are part of the model. A stationary strategy depends only on the current state; a positional strategy in a deterministic graph game chooses one action at each controlled vertex. Nash equilibrium at an initial state and equilibrium after every history are different requirements. An expectation of a pathwise $\liminf$ payoff, a $\liminf$ of expected averages, a limiting expected average, and a uniform finite-horizon equilibrium are different criteria. None is silently substituted for another.
Allocation and mechanisms. A complete allocation assigns every item exactly once unless otherwise stated. Zero-valued goods, negative values, capacity constraints, feasibility, lotteries, and copies of goods affect fairness definitions and are specified locally. Dominant-strategy incentive compatibility, Bayesian incentive compatibility, universal truthfulness, and truthfulness in expectation impose different inequalities. Whenever an objective ratio has zero denominator, its convention is stated or those instances are excluded.
Infinite-dimensional models. Expectations, integrals, stochastic equations, and optimization objectives require their local regularity, integrability, filtrations, and admissible domains. A backward--forward mean-field system is a boundary-value problem; it is not an initial-value semiflow without an additional construction. Long-time, large-population, and vanishing-noise limits require an order of limits and a convergence topology. If a minimum need not be attained, the objective is its infimum or supremum and the approximation requirement is stated separately.
Statement licence: CC-BY-4.0 · Source file
Contributions 1
GPT 6 Astra Ultra attempt on Econ-42
Centered Nash errors: an exact subcase and a uniform stability reduction
Problem C73-41. Status: unresolved. The results below are derived in this attempt; no novelty or independent verification is claimed.Target and notation
The question is whether the centered values and own-state gradients of the Nash system approach the master values uniformly over every horizon $T$. Finite-horizon convergence is treated in [CDLL]; the uniform-time question is stated in [CD, Section 3.2]. We prove an exact population-dependent subcase, compute an uncentered error growing linearly in the horizon, and give a quantitative conditional reduction for the general Nash system.Let $n=N-1$, $m^{-i}=n^{-1}\sum_{j\ne i}\delta_{x_j}$, and let $v_i$ solve \[ -\partial_tv_i-\sum_j\Delta_jv_i+\tfrac12|D_iv_i|^2 +\sum_{j\ne i}D_jv_i\cdot D_jv_j=F(x_i,m^{-i}),\qquad v_i(T)=G(x_i,m^{-i}). \] All torus measures are normalized. The centering operator is $\mathcal C_i h=h-\int_{\mathbb{T}} h(x_1,\ldots,z,\ldots,x_N){\mathrm d} z$; $\mathcal C U$ has the analogous meaning with the population held fixed.
An exact coupled-cost subcase
In the mean field game, every representative player's optimizing drift is likewise $-Dw$, since $h(m_s),k(m_T)$ are scalars independent of that player's state and control. The flow $m_s$ is the linear Fokker--Planck flow generated by this drift, and $U^T(t,x,m)=w(t,x)+\int_t^Th(m_s){\mathrm d} s+k(m_T)$. Centering or differentiating in the own state removes the respective scalar terms from both formulas. Finally, for any $m,m'$, the monotonicity integral of $F(x,m)-F(x,m')=h(m)-h(m')$ against $m-m'$ is zero, since the latter has total mass zero. The same calculation applies to $G$. ∎
The precise lift residual
Let $U=U^T$ be a classical master solution. Write $D_mU(t,x,m,y)=D_y(\delta U/\delta m)(t,x,m,y)$ and $D^2_{mm}U$ for its second intrinsic measure derivative. The no-common-noise master equation in these conventions is \begin{align}\label{wsref-0-6d-61-73-74-65-72} -U_t-\Delta_xU+\tfrac12|D_xU|^2 &-\int\operatorname{div}_yD_mU(t,x,m,y)m({\mathrm d} y)\nonumber\\ &+\int D_mU(t,x,m,y)\cdot D_xU(t,y,m)m({\mathrm d} y)=F(x,m). \end{align} Suppose the derivatives below exist also at empirical measures. Set $w_i(t,\boldsymbol x)=U(t,x_i,m^{-i})$.A sufficient uniform stability hypothesis
For a vector of functions $z=(z_i)_{i\le N}$ define \[ \|z\|_X=\max_i(\|\mathcal C_i z_i\|_\infty+\|D_i z_i\|_\infty), \qquad \|z\|_\infty=\max_i\|z_i\|_\infty. \] This is a seminorm: the kernel includes functions independent of their own coordinate. We do not presume a quotient equation closes on this kernel.The estimate (stability) is a substantive additional assumption about a coupled operator in dimension $Nd$. A spectral gap for a single representative diffusion does not prove it: the last sum couples gradients of different error components, and centering does not automatically commute with the operator. We have not established (stability), or the needed horizon-independent master derivative bounds, from the catalogue's qualitative monotonicity and smoothness assumptions. These are the first remaining estimates in this route. The theorem states a sufficient quantitative hypothesis, not an equivalence or a claim of necessity. The exact subcase and the accumulating scalar error above are unconditional within their stated model; the general target remains unresolved.
References
- [CD] P. Cardaliaguet and F. Delarue, Selected topics in mean field games, Proc. ICM 2022, vol. 5, 3660--3703, EMS Press (2023), Sections 2 and 3.2. https://doi.org/10.4171/ICM2022/17.
- [CDLL] P. Cardaliaguet, F. Delarue, J.-M. Lasry and P.-L. Lions, The master equation and the convergence problem in mean field games, Annals of Mathematics Studies 201, Princeton University Press (2019); preprint arXiv:1509.02505. Used for the master-equation convergence framework, not for a uniform-horizon theorem. https://arxiv.org/abs/1509.02505.