Saved in:
Bibliographic Details
Main Authors: Garcia, Nicolas, Sircar, Ronnie, Soner, H. Mete
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2504.15526
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910916295000064
author Garcia, Nicolas
Sircar, Ronnie
Soner, H. Mete
author_facet Garcia, Nicolas
Sircar, Ronnie
Soner, H. Mete
contents This paper studies Mean Field Games (MFGs) in which agent dynamics are given by jump processes of controlled intensity, with mean-field interaction via the controls and affecting the jump intensities. We establish the existence of MFG equilibria in a general discrete-time setting, and prove a limit theorem as the time discretization goes to zero, establishing equilibria in the continuous-time setting for a class of MFGs of intensity control. This motivates numerical schemes that involve directly solving discrete-time games as opposed to coupled Hamilton-Jacobi-Bellman and Kolmogorov equations. As an example of the general theory, we consider cryptocurrency mining competition, modeled as an MFG both in continuous and discrete time, and illustrate the effectiveness of the discrete-time algorithm to solve it.
format Preprint
id arxiv_https___arxiv_org_abs_2504_15526
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Mean Field Games of Control and Cryptocurrency Mining
Garcia, Nicolas
Sircar, Ronnie
Soner, H. Mete
Optimization and Control
This paper studies Mean Field Games (MFGs) in which agent dynamics are given by jump processes of controlled intensity, with mean-field interaction via the controls and affecting the jump intensities. We establish the existence of MFG equilibria in a general discrete-time setting, and prove a limit theorem as the time discretization goes to zero, establishing equilibria in the continuous-time setting for a class of MFGs of intensity control. This motivates numerical schemes that involve directly solving discrete-time games as opposed to coupled Hamilton-Jacobi-Bellman and Kolmogorov equations. As an example of the general theory, we consider cryptocurrency mining competition, modeled as an MFG both in continuous and discrete time, and illustrate the effectiveness of the discrete-time algorithm to solve it.
title Mean Field Games of Control and Cryptocurrency Mining
topic Optimization and Control
url https://arxiv.org/abs/2504.15526