Stochastic Graphon Games with Jumps and Approximate Nash Equilibria
read the original abstract
We study continuous stochastic games with heterogeneous mean field interactions and jumps on large networks and explore their limit counterparts. We introduce the graphon game model based on a controlled graphon mean field stochastic differential equation system with jumps, which can be regarded as the limiting case of a finite game dynamic system as the number of players goes to infinity. We examine the case of controlled dynamics, with control terms present in the drift, diffusion, and jump components. We focus on the study of Markovian controls and concentrate on the limit theory. We provide convergence results on the state trajectories and their laws, transitioning from finite game systems to graphon systems. We also study approximate equilibria for finite games on large networks, using the graphon equilibrium as a benchmark. The rates of convergence are analyzed under various underlying graphon models and regularity assumptions.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Exponential ergodicity of exact and numerical solutions for McKean-Vlasov SDEs driven by L\'evy noise
Establishes exponential ergodicity and convergence rates between exact and tamed-Euler invariant measures for McKean-Vlasov Lévy SDEs via propagation of chaos and uniform-in-time strong convergence.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.