相关论文: Mean field systems on networks, with singular inte…

We study a class of linear-quadratic stochastic differential games in which each player interacts directly only with its nearest neighbors in a given graph. We find a semi-explicit Markovian equilibrium for any transitive graph, in terms of…

Consider an interacting particle system indexed by the vertices of a (possibly random) locally finite graph whose vertices and edges are equipped with marks representing parameters of the model such as the environment and initial…

This paper investigates the limit behavior of Markov Decision Processes (MDPs) made of independent particles evolving in a common environment, when the number of particles goes to infinity. In the finite horizon case or with a discounted…

Recent advances at the intersection of dense large graph limits and mean field games have begun to enable the scalable analysis of a broad class of dynamical sequential games with large numbers of agents. So far, results have been largely…

We consider finite horizon stochastic mean field games in which the state space is a network. They are described by a system coupling a backward in time Hamilton-Jacobi-Bellman equation and a forward in time Fokker-Planck equation. The…

In this article, we study an interacting particle system in the context of epidemiology where the individuals (particles) are characterized by their position and infection state. We begin with a description at the microscopic level where…

We study a general class of interacting particle systems over a countable state space $V$ where on each site $x \in V$ the particle mass $\eta(x) \geq 0$ follows a stochastic differential equation. We construct the corresponding Markovian…

This paper is devoted to finite horizon deterministic mean field games in which the state space is a network. The agents control their velocity, and when they occupy a vertex, they can enter into any incident edge. The running and terminal…

We explore a mechanism of decision-making in Mean Field Games with myopic players. At each instant, agents set a strategy which optimizes their expected future cost by assuming their environment as immutable. As the system evolves, the…

We study two interacting particle systems, both modeled as a system of $N$ stochastic differential equations driven by Brownian motions with singular kernels and moderate interaction. We show a quantitative result where the convergence rate…

We study systems of Brownian particles on the real line, which interact by splitting the local times of collisions among themselves in an asymmetric manner. We prove the strong existence and uniqueness of such processes and identify them…

Strategic network formation arises where agents receive benefit from connections to other agents, but also incur costs for forming links. We consider a new network formation game that incorporates an adversarial attack, as well as…

We study the mean field approximation of a recent model of cascades on networks relevant to the investigation of systemic risk control in financial networks. In the model, the hypothesis of a trend reinforcement in the stochastic process…

In this work, we consider one-dimensional particles interacting in mean-field type through a bounded kernel. In addition, when particles hit some barrier (say zero), they are removed from the system. This absorption of particles is…

We consider a discrete-time system of n coupled random vectors, a.k.a. interacting particles. The dynamics involve a vanishing step size, some random centered perturbations, and a mean vector field which induces the coupling between the…

We study the uniqueness of solutions to systems of PDEs arising in Mean Field Games with several populations of agents and Neumann boundary conditions. The main assumption requires the smallness of some data, e.g., the length of the time…

A discrete time stochastic model for a multiagent system given in terms of a large collection of interacting Markov chains is studied. The evolution of the interacting particles is described through a time inhomogeneous transition…

Time-limited states characterise many dynamical processes on networks: disease infected individuals recover after some time, people forget news spreading on social networks, or passengers may not wait forever for a connection. These…

In this work we study the dynamics of systems composed of numerous interacting elements interconnected through a random weighted directed graph, such as models of random neural networks. We develop an original theoretical approach based on…

Large ensembles of stochastically evolving interacting particles describe phenomena in diverse fields including statistical physics, neuroscience, biology, and engineering. In such systems, the infinitesimal evolution of each particle…