We study Nash equilibria for a sequence of symmetric N-player stochastic games of finite-fuel capacity expansion with singular controls and their mean-field game (MFG) counterpart. We construct a solution of the MFG via a simple iterative scheme that produces an optimal control in terms of a Skorokhod reflection at a (state-dependent) surface that splits the state space into action and inaction regions. We then show that a solution of the MFG of capacity expansion induces approximate Nash equilibria for the N-player games with approximation error ε going to zero as N tends to infinity. Our analysis relies entirely on probabilistic methods and extends the well-known connection between singular stochastic control and optimal stopping to a mean-field framework.
MEAN-FIELD GAMES OF FINITE-FUEL CAPACITY EXPANSION WITH SINGULAR CONTROLS
de Angelis T.;
2022-01-01
Abstract
We study Nash equilibria for a sequence of symmetric N-player stochastic games of finite-fuel capacity expansion with singular controls and their mean-field game (MFG) counterpart. We construct a solution of the MFG via a simple iterative scheme that produces an optimal control in terms of a Skorokhod reflection at a (state-dependent) surface that splits the state space into action and inaction regions. We then show that a solution of the MFG of capacity expansion induces approximate Nash equilibria for the N-player games with approximation error ε going to zero as N tends to infinity. Our analysis relies entirely on probabilistic methods and extends the well-known connection between singular stochastic control and optimal stopping to a mean-field framework.File | Dimensione | Formato | |
---|---|---|---|
Campi-DeAngelis-Ghio-Livieri(2020)-revision.pdf
Accesso aperto
Dimensione
682.81 kB
Formato
Adobe PDF
|
682.81 kB | Adobe PDF | Visualizza/Apri |
Campi-DeAngelis-Ghio-Livieri(2022).pdf
Accesso riservato
Tipo di file:
PDF EDITORIALE
Dimensione
510.35 kB
Formato
Adobe PDF
|
510.35 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.