Graphon Mean-Field Logit Dynamic

• Graphon mean-field logit dynamic is a stationary mean-field game that models a continuum of heterogeneous agents whose interactions are encoded by a graphon and whose actions follow a logit or soft-max rule.
• It is derived from an infinite-horizon discounted stochastic control problem with entropy penalization, resulting in a coupled system of Hamilton–Jacobi–Bellman equations.
• The framework has practical applications, such as fisheries management, and uses finite difference schemes to approximate the nonlinear HJB system under graphon-mediated interactions.

Graphon mean-field logit dynamic denotes a stationary mean-field game for a continuum of heterogeneous agents whose interactions are encoded by a graphon and whose action selection follows a logit or soft-max structure. In the formulation introduced in "Graphon Mean-Field Logit Dynamic: Derivation, Computation, and Applications" (Yoshioka, 17 Aug 2025), agents are indexed by a type variable $y\in I=[0,1]$, choose actions $x\in Q=[0,1]$, and are coupled through a graphon $W$ via the utility. The model is derived from an infinite-horizon discounted stochastic control problem with entropy penalization, yields a continuum of coupled Hamilton–Jacobi–Bellman equations, admits a unique bounded solution under a sufficiently large discount assumption, and is accompanied by a finite difference scheme and a fisheries-management case study (Yoshioka, 17 Aug 2025).

1. Definition and basic structure

The graphon mean-field logit dynamic generalizes the classical logit dynamic from a homogeneous population to a continuum of heterogeneous agents indexed by type. In the homogeneous benchmark recalled in (Yoshioka, 17 Aug 2025), a time-dependent measure $u_t\in\mathcal P(Q)$ on the action space $Q=[0,1]$ evolves as

$$\frac{d u_t(dx)}{dt}=\mathcal{L}[u_t](x)\,dx-u_t(dx),$$

with the logit choice rule

$$\mathcal{L}[u](x)=\frac{e^{nU(x,u)}}{\int_Q e^{nU(z,u)}\,dz},$$

where $n>0$ is the inverse-noise or regularization parameter. The same paper states that $\mathcal{L}[u]$ is equivalently the optimizer of a utility-plus-entropy problem,

$$\mathcal{L}[u](x)=\arg\max_{\phi(\cdot)dx\in \mathcal P(Q)} \left\{ \int_Q U(x,u)\phi(x)\,dx-\frac{1}{n}\int_Q \phi(x)\ln\phi(x)\,dx \right\}.$$

This is the soft-max structure of the model: larger $x\in Q=[0,1]$0 yields stronger concentration near the utility maximizer, while smaller $x\in Q=[0,1]$1 yields more randomness or entropy (Yoshioka, 17 Aug 2025).

The graphon extension replaces the single action distribution by a family of distributions $x\in Q=[0,1]$2, one for each type $x\in Q=[0,1]$3. The graphon $x\in Q=[0,1]$4 is assumed symmetric and integrable,

$x\in Q=[0,1]$5

The coupling across types enters through the utility, so the model is not merely a family of uncoupled logit equations but a continuum of coupled control problems connected through a graphon-weighted interaction operator (Yoshioka, 17 Aug 2025).

A central feature of the formulation is that it is stationary and control-based. This distinguishes it from models that begin directly with an evolutionary logit differential equation. The paper explicitly describes the resulting object as a stationary mean-field game based on logit interactions (Yoshioka, 17 Aug 2025).

2. Stochastic-control derivation and coupled HJB system

For each type $x\in Q=[0,1]$6, the model is formulated as an infinite-horizon discounted stochastic control problem in which the state $x\in Q=[0,1]$7 evolves by a jump process,

$x\in Q=[0,1]$8

Jumps move the current action $x\in Q=[0,1]$9 to a new action $W$0 drawn from a controlled distribution $W$1. The objective for a type-$W$2 agent starting from $W$3 is

$W$4

where $W$5 is a type-dependent discount rate, $W$6 is a type-dependent entropy or logit parameter, $W$7 is the discounted time-average occupation measure, and $W$8 is the density of the control distribution (Yoshioka, 17 Aug 2025). The occupation measure is

$W$9

The value function

$u_t\in\mathcal P(Q)$0

satisfies the Hamilton–Jacobi–Bellman equation

$u_t\in\mathcal P(Q)$1

The maximizing density is the logit rule

$u_t\in\mathcal P(Q)$2

and substitution yields the closed HJB form

$u_t\in\mathcal P(Q)$3

The associated FP or occupation-measure equation is

$u_t\in\mathcal P(Q)$4

which is formally solvable as

$u_t\in\mathcal P(Q)$5

The paper emphasizes that this is a weighted average of the initial distribution and the logit response (Yoshioka, 17 Aug 2025).

Eliminating $u_t\in\mathcal P(Q)$6 produces a single nonlinear integral equation for $u_t\in\mathcal P(Q)$7,

$u_t\in\mathcal P(Q)$8

which the paper refers to as the HJB system. The coupling across $u_t\in\mathcal P(Q)$9 arises because the utility $Q=[0,1]$0 may depend on all types through a graphon (Yoshioka, 17 Aug 2025).

3. Graphon coupling, assumptions, and well-posedness

The graphon enters through the utility. The local utility $Q=[0,1]$1 is lifted to a graphon utility by

$Q=[0,1]$2

This preserves boundedness and Lipschitz continuity up to multiplicative constants: $Q=[0,1]$3

$Q=[0,1]$4

If $Q=[0,1]$5 is continuous in $Q=[0,1]$6 or $Q=[0,1]$7, the corresponding continuity of $Q=[0,1]$8 follows, with graphon regularity controlling the $Q=[0,1]$9-dependence (Yoshioka, 17 Aug 2025).

The analysis in (Yoshioka, 17 Aug 2025) assumes boundedness

$$\frac{d u_t(dx)}{dt}=\mathcal{L}[u_t](x)\,dx-u_t(dx),$$0

Lipschitz continuity in measure

$$\frac{d u_t(dx)}{dt}=\mathcal{L}[u_t](x)\,dx-u_t(dx),$$1

and, for equi-continuity results, continuity moduli in $$\frac{d u_t(dx)}{dt}=\mathcal{L}[u_t](x)\,dx-u_t(dx),$$2 and $$\frac{d u_t(dx)}{dt}=\mathcal{L}[u_t](x)\,dx-u_t(dx),$$3. The discount parameters are summarized by

$$\frac{d u_t(dx)}{dt}=\mathcal{L}[u_t](x)\,dx-u_t(dx),$$4

The key contraction condition is

$$\frac{d u_t(dx)}{dt}=\mathcal{L}[u_t](x)\,dx-u_t(dx),$$5

Under this sufficiently large discount condition, the HJB self-map on bounded functions is contractive, and Banach’s fixed-point theorem yields existence and uniqueness of a bounded solution $$\frac{d u_t(dx)}{dt}=\mathcal{L}[u_t](x)\,dx-u_t(dx),$$6, $$\frac{d u_t(dx)}{dt}=\mathcal{L}[u_t](x)\,dx-u_t(dx),$$7 (Yoshioka, 17 Aug 2025).

The same paper establishes a priori bounds: $$\frac{d u_t(dx)}{dt}=\mathcal{L}[u_t](x)\,dx-u_t(dx),$$8 Under continuity assumptions on $$\frac{d u_t(dx)}{dt}=\mathcal{L}[u_t](x)\,dx-u_t(dx),$$9, the unique solution inherits equi-continuity. If $$\mathcal{L}[u](x)=\frac{e^{nU(x,u)}}{\int_Q e^{nU(z,u)}\,dz},$$0 is equi-continuous in $$\mathcal{L}[u](x)=\frac{e^{nU(x,u)}}{\int_Q e^{nU(z,u)}\,dz},$$1, then for $$\mathcal{L}[u](x)=\frac{e^{nU(x,u)}}{\int_Q e^{nU(z,u)}\,dz},$$2,

$$\mathcal{L}[u](x)=\frac{e^{nU(x,u)}}{\int_Q e^{nU(z,u)}\,dz},$$3

If $$\mathcal{L}[u](x)=\frac{e^{nU(x,u)}}{\int_Q e^{nU(z,u)}\,dz},$$4 is equi-continuous in $$\mathcal{L}[u](x)=\frac{e^{nU(x,u)}}{\int_Q e^{nU(z,u)}\,dz},$$5 and $$\mathcal{L}[u](x)=\frac{e^{nU(x,u)}}{\int_Q e^{nU(z,u)}\,dz},$$6, $$\mathcal{L}[u](x)=\frac{e^{nU(x,u)}}{\int_Q e^{nU(z,u)}\,dz},$$7 are constant, then

$$\mathcal{L}[u](x)=\frac{e^{nU(x,u)}}{\int_Q e^{nU(z,u)}\,dz},$$8

A combined estimate is also given (Yoshioka, 17 Aug 2025).

The role of discounting is structurally central. The paper states that large $$\mathcal{L}[u](x)=\frac{e^{nU(x,u)}}{\int_Q e^{nU(z,u)}\,dz},$$9 suppresses the long-horizon feedback from the logit response and makes the fixed-point map contractive. It also states that as $n>0$0, $n>0$1 pointwise, whereas as $n>0$2, the graphon mean-field logit dynamic behaves differently from the classical discounted logit dynamic and does not reduce to the standard logit equilibrium in the same way (Yoshioka, 17 Aug 2025). This is one of the main conceptual distinctions of the model.

4. Numerical formulation and discrete solvability

The paper proposes a finite difference method for the nonlinear HJB system. The domain $n>0$3 is discretized on a grid $n>0$4, and the graphon-integral utility is approximated by quadrature,

$n>0$5

The log-sum-exp term is discretized by

$n>0$6

The discrete HJB system then takes the form

$n>0$7

up to the exact notation used in the paper (Yoshioka, 17 Aug 2025).

The numerical solution is obtained by a relaxed fixed-point iteration,

$n>0$8

with a stopping criterion based on the maximum change. The discrete map preserves the bounds

$n>0$9

Under a discrete Lipschitz condition analogous to the continuous assumption and sufficiently large discount, the discrete fixed-point map is a contraction, giving unique existence of the numerical solution (Yoshioka, 17 Aug 2025).

With additional regularity assumptions on the local utility $\mathcal{L}[u]$0, the weight $\mathcal{L}[u]$1, and the graphon approximation, the paper proves convergence of the discrete solution to the continuous one: $\mathcal{L}[u]$2 The proof decomposes the total error into graphon quadrature error, coefficient approximation error, and discretization error of $\mathcal{L}[u]$3 and $\mathcal{L}[u]$4 (Yoshioka, 17 Aug 2025).

A notable technical qualification concerns viscosity monotonicity. The paper states that for nontrivial graphon coupling, the scheme is generally not monotone in the Barles–Souganidis sense, so viscosity convergence is not guaranteed in the heterogeneous graphon case; in contrast, in the homogeneous case $\mathcal{L}[u]$5, such monotonicity may hold (Yoshioka, 17 Aug 2025). This point is important because it marks a limitation of direct transfer from standard scalar HJB discretization theory.

5. Applications and computational behavior

The principal application in (Yoshioka, 17 Aug 2025) concerns fisheries management in the upper Tedori River system in Ishikawa Prefecture, Japan. In that model, the state $\mathcal{L}[u]$6 is interpreted as fishing pressure and the type $\mathcal{L}[u]$7 as location along the river, from downstream to upstream. The local utility is

$\mathcal{L}[u]$8

where $\mathcal{L}[u]$9 is decreasing in average fishing pressure, and $$\mathcal{L}[u](x)=\arg\max_{\phi(\cdot)dx\in \mathcal P(Q)} \left\{ \int_Q U(x,u)\phi(x)\,dx-\frac{1}{n}\int_Q \phi(x)\ln\phi(x)\,dx \right\}.$$0 is an increasing cost function in $$\mathcal{L}[u](x)=\arg\max_{\phi(\cdot)dx\in \mathcal P(Q)} \left\{ \int_Q U(x,u)\phi(x)\,dx-\frac{1}{n}\int_Q \phi(x)\ln\phi(x)\,dx \right\}.$$1, reflecting higher upstream costs and conservation fees (Yoshioka, 17 Aug 2025). The graphon is taken as a Gaussian-like kernel,

$$\mathcal{L}[u](x)=\arg\max_{\phi(\cdot)dx\in \mathcal P(Q)} \left\{ \int_Q U(x,u)\phi(x)\,dx-\frac{1}{n}\int_Q \phi(x)\ln\phi(x)\,dx \right\}.$$2

with $$\mathcal{L}[u](x)=\arg\max_{\phi(\cdot)dx\in \mathcal P(Q)} \left\{ \int_Q U(x,u)\phi(x)\,dx-\frac{1}{n}\int_Q \phi(x)\ln\phi(x)\,dx \right\}.$$3 controlling interaction width, and the cost is modeled as

$$\mathcal{L}[u](x)=\arg\max_{\phi(\cdot)dx\in \mathcal P(Q)} \left\{ \int_Q U(x,u)\phi(x)\,dx-\frac{1}{n}\int_Q \phi(x)\ln\phi(x)\,dx \right\}.$$4

with $$\mathcal{L}[u](x)=\arg\max_{\phi(\cdot)dx\in \mathcal P(Q)} \left\{ \int_Q U(x,u)\phi(x)\,dx-\frac{1}{n}\int_Q \phi(x)\ln\phi(x)\,dx \right\}.$$5 controlling transition sharpness.

The numerical study uses

$$\mathcal{L}[u](x)=\arg\max_{\phi(\cdot)dx\in \mathcal P(Q)} \left\{ \int_Q U(x,u)\phi(x)\,dx-\frac{1}{n}\int_Q \phi(x)\ln\phi(x)\,dx \right\}.$$6

and the uniform initial measure $$\mathcal{L}[u](x)=\arg\max_{\phi(\cdot)dx\in \mathcal P(Q)} \left\{ \int_Q U(x,u)\phi(x)\,dx-\frac{1}{n}\int_Q \phi(x)\ln\phi(x)\,dx \right\}.$$7 (Yoshioka, 17 Aug 2025). The paper compares the discounted logit dynamic and the graphon mean-field logit dynamic in four parameter cases:

• Case A: $$\mathcal{L}[u](x)=\arg\max_{\phi(\cdot)dx\in \mathcal P(Q)} \left\{ \int_Q U(x,u)\phi(x)\,dx-\frac{1}{n}\int_Q \phi(x)\ln\phi(x)\,dx \right\}.$$8,
• Case B: $$\mathcal{L}[u](x)=\arg\max_{\phi(\cdot)dx\in \mathcal P(Q)} \left\{ \int_Q U(x,u)\phi(x)\,dx-\frac{1}{n}\int_Q \phi(x)\ln\phi(x)\,dx \right\}.$$9,
• Case C: $x\in Q=[0,1]$00,
• Case D: $x\in Q=[0,1]$01.

The computational observations reported in (Yoshioka, 17 Aug 2025) are specific. Smaller $x\in Q=[0,1]$02 tends to make distributions vary more strongly across $x\in Q=[0,1]$03. Larger $x\in Q=[0,1]$04 makes the distribution sharper in $x\in Q=[0,1]$05. The discounted logit dynamic generally produces more variable and sometimes non-monotone profiles, whereas the graphon mean-field logit dynamic produces smoother profiles, reflecting the control-theoretic averaging through the occupation measure. As $x\in Q=[0,1]$06 increases, the graphon induces stronger spatial averaging and smooths profiles in $x\in Q=[0,1]$07; smaller $x\in Q=[0,1]$08 yields more localized interaction and sharper spatial structure. The paper also reports that higher cost in protected upstream zones is effective in reducing fishing pressure, especially when anglers are more farsighted and when interactions are more localized (Yoshioka, 17 Aug 2025).

These findings situate the graphon within the model as more than a passive heterogeneity index. It acts as a tunable interaction geometry that materially alters the stationary action profile.

6. Relation to generalized logit dynamics and to graphon mean-field game theory

The closest precursor in the supplied literature is "Computational analysis on a linkage between generalized logit dynamic and discounted mean field game" (Yoshioka, 2024). That paper does not explicitly use the term graphon, but it studies a type-heterogeneous, nonlocal continuum-action framework in which player types $x\in Q=[0,1]$09 carry distributions $x\in Q=[0,1]$10 over $x\in Q=[0,1]$11, with coupling through nonlocal integrals (Yoshioka, 2024). Its central claim is that a generalized logit dynamic can be interpreted as the large-discount limit of a discounted mean field game with costly decision making, where the logit effect is encoded through a Tsallis or deformed exponential and the optimal control has a generalized softmax form (Yoshioka, 2024). In particular, the optimal control is

$x\in Q=[0,1]$12

and the forward equation reduces heuristically to the generalized logit dynamic in the large-discount limit (Yoshioka, 2024).

This comparison clarifies a common misconception. The graphon mean-field logit dynamic of (Yoshioka, 17 Aug 2025) is not simply the graphonization of the generalized logit dynamic in (Yoshioka, 2024). The former is a stationary graphon mean-field game built from an entropy-regularized stochastic control problem and a discounted occupation measure, whereas the latter explains a generalized logit dynamic as a myopic limit of a discounted mean field game and uses Tsallis-type regularization rather than the Shannon-entropy form emphasized in (Yoshioka, 17 Aug 2025). The data explicitly state that the graphon-free model of (Yoshioka, 2024) is graphon-adjacent but not graphon-specific.

A second misconception is to identify graphon mean-field logit dynamics with graphon mean-field games in general. "Non--exchangeable mean field games with moderate interactions and common noise" (Djete, 14 May 2026) studies a non-exchangeable mean field game with labels $x\in Q=[0,1]$13, graphon-type heterogeneous interaction, a moderate local kernel, and possible common noise, and proves existence, strict realization, uniqueness in a monotone case, and two-way finite-player asymptotics (Djete, 14 May 2026). However, the data explicitly state that this paper does not treat logit dynamics, entropy regularization, or stochastic-choice equilibria directly. The relation is conceptual: relaxed controls provide a measure-valued action formalism, but not a logit equilibrium rule (Djete, 14 May 2026).

Likewise, "Stochastic Graphon Games with Jumps and Approximate Nash Equilibria" (Amini et al., 2023) develops a controlled graphon mean field stochastic differential equation system with jumps, existence and uniqueness of graphon equilibrium, convergence from finite networks, and approximate Nash equilibrium results. The paper does not study logit dynamics explicitly, but it supplies the graphon state space, graphon-consistent coupling operator, Markovian feedback controls, and finite-to-graphon approximation theory that would support a graphon-level soft best-response or entropy-regularized model (Amini et al., 2023).

A further adjacent direction appears in "Reinforcement Learning for SBM Graphon Games with Re-Sampling" (Huo et al., 2023), where the graphon is a stochastic block model graphon and policy improvement is performed by a Policy Mirror Ascent operator,

$x\in Q=[0,1]$14

The data note that when $x\in Q=[0,1]$15 is Shannon entropy, the solution is a logit or softmax-like policy, making the framework a graphon-mean-field analogue of entropy-regularized policy iteration (Huo et al., 2023). This places graphon mean-field logit dynamics within a broader family of regularized response models on heterogeneous network limits.

Taken together, these works support a precise delimitation. Graphon mean-field logit dynamic, in the strict sense of (Yoshioka, 17 Aug 2025), is a stationary graphon mean-field game with entropy-regularized jump control, a continuum of coupled HJB equations, and graphon-mediated heterogeneity. It is related to generalized logit dynamics, to graphon mean-field games, and to mirror-ascent learning on graphons, but it should not be collapsed into any one of those neighboring frameworks (Yoshioka, 17 Aug 2025, Yoshioka, 2024, Djete, 14 May 2026, Amini et al., 2023, Huo et al., 2023).