scholarly journals Stochastic Graphon Games: I. The Static Case

Author(s):  
René Carmona ◽  
Daniel B. Cooney ◽  
Christy V. Graves ◽  
Mathieu Laurière

We consider static finite-player network games and their continuum analogs graphon games. Existence and uniqueness results are provided as well as convergence of the finite-player network game optimal strategy profiles to their analogs for the graphon games. We also show that equilibrium strategy profiles of a graphon game provide approximate Nash equilibria for the finite-player games. Connections with mean field games are discussed. A motivating application of Cournot competition is presented, and explicit computation of its Nash equilibrium is provided.

Author(s):  
Christoph Belak ◽  
Daniel Hoffmann ◽  
Frank T. Seifried

AbstractWe formulate and analyze a mathematical framework for continuous-time mean field games with finitely many states and common noise, including a rigorous probabilistic construction of the state process and existence and uniqueness results for the resulting equilibrium system. The key insight is that we can circumvent the master equation and reduce the mean field equilibrium to a system of forward-backward systems of (random) ordinary differential equations by conditioning on common noise events. In the absence of common noise, our setup reduces to that of Gomes, Mohr and Souza (Appl Math Optim 68(1): 99–143, 2013) and Cecchin and Fischer (Appl Math Optim 81(2):253–300, 2020).


Author(s):  
MATT BARKER ◽  
PIERRE DEGOND ◽  
MARIE-THERESE WOLFRAM

Mean-field games (MFGs) and the best-reply strategy (BRS) are two methods of describing competitive optimisation of systems of interacting agents. The latter can be interpreted as an approximation of the respective MFG system. In this paper, we present an analysis and comparison of the two approaches in the stationary case. We provide novel existence and uniqueness results for the stationary boundary value problems related to the MFG and BRS formulations, and we present an analytical and numerical comparison of the two paradigms in some specific modelling situations.


2018 ◽  
Vol 56 (6) ◽  
pp. 4256-4287 ◽  
Author(s):  
Naci Saldi ◽  
Tamer Başar ◽  
Maxim Raginsky

2013 ◽  
Vol 24 (1) ◽  
pp. 93-115 ◽  
Author(s):  
Pierre Degond ◽  
Jian-Guo Liu ◽  
Christian Ringhofer

Author(s):  
Matteo Basei ◽  
Haoyang Cao ◽  
Xin Guo

We consider a general class of nonzero-sum N-player stochastic games with impulse controls, where players control the underlying dynamics with discrete interventions. We adopt a verification approach and provide sufficient conditions for the Nash equilibria (NEs) of the game. We then consider the limiting situation when N goes to infinity, that is, a suitable mean-field game (MFG) with impulse controls. We show that under appropriate technical conditions, there exists a unique NE solution to the MFG, which is an ϵ-NE approximation to the N-player game, with [Formula: see text]. As an example, we analyze in detail a class of two-player stochastic games which extends the classical cash management problem to the game setting. In particular, we present numerical analysis for the cases of the single player, the two-player game, and the MFG, showing the impact of competition on the player’s optimal strategy, with sensitivity analysis of the model parameters.


Sign in / Sign up

Export Citation Format

Share Document