REVIEW 1 cited by
Finite State Graphon Games with Applications to Epidemics
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Finite State Graphon Games with Applications to Epidemics
read the original abstract
We consider a game for a continuum of non-identical players evolving on a finite state space. Their heterogeneous interactions are represented by a graphon, which can be viewed as the limit of a dense random graph. The player's transition rates between the states depend on their own control and the interaction strengths with the other players. We develop a rigorous mathematical framework for this game and analyze Nash equilibria. We provide a sufficient condition for a Nash equilibrium and prove existence of solutions to a continuum of fully coupled forward-backward ordinary differential equations characterizing equilibria. Moreover, we propose a numerical approach based on machine learning tools and show experimental results on different applications to compartmental models in epidemiology.
Forward citations
Cited by 1 Pith paper
-
Network-Wide Traffic Volume Estimation from Speed Profiles using a Spatio-Temporal Graph Neural Network with Directed Spatial Attention
An inductive spatio-temporal graph network estimates network-wide daily traffic volumes from speed profiles and road attributes, without volume data at inference.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.