相关论文: Modeling of Rumor Propagation in Large Populations…

We study the control of rumor propagation in large networked populations by using Stackelberg graphon games. We first introduce a principal who wants to incentivize the spread of her preferred news and discourage the spread of non-preferred…

In this paper, we study a model of network formation in large populations. Each agent can choose the strength of interaction (i.e. connection) with other agents to find a Nash equilibrium. Different from the recently-developed theory of…

We consider a gossip approach for finding a Nash equilibrium in a distributed multi-player network game. We extend previous results on Nash equilibrium seeking to the case when the players' cost functions may be affected by the actions of…

We propose an SIS competition model describing the propagation of conflicting rumors, such as fake news and its corrections. This simple model captures the interaction between rumor propagation and opinion dynamics, where rumors drive…

We propose an approach to modelling large-scale multi-agent dynamical systems allowing interactions among more than just pairs of agents using the theory of mean field games and the notion of hypergraphons, which are obtained as limits of…

In this paper, we study graphon mean field games using a system of forward-backward stochastic differential equations. We establish the existence and uniqueness of solutions under two different assumptions and prove the stability with…

We consider a game for a continuum of non-identical players evolving on a finite state space. Their heterogeneous interactions are represented by a graphon, which can be viewed as the limit of a dense random graph. The player's transition…

One major function of social networks (e.g., massive online social networks) is the dissemination of information such as scientific knowledge, news, and rumors. Information can be propagated by the users of the network via natural…

This paper considers a distributed gossip approach for finding a Nash equilibrium in networked games on graphs. In such games a player's cost function may be affected by the actions of any subset of players. An interference graph is…

Graphon games are a class of games with a continuum of agents, introduced to approximate the strategic interactions in large network games. The first result of this study is an equilibrium existence theorem in graphon games, under the same…

We consider the spread of infectious diseases through a Mean Field Game version of a SIR compartmental model with social structure, in which individuals are grouped by their age class and interact together in different settings. In our game…

We investigate an SIR model of epidemic propagation on networks in the context of mean-field games. In a real epidemic, individuals adjust their behavior depending on the epidemic level and the impact it might have on them in the future.…

In a competitive marketing, there are a large number of players which produce the same product. Each firm aims to diffuse its product information widely so that it's product will become popular among potential buyers. The more popular is a…

In this paper we propose a deterministic mathematical model that attempts to explain the propagation of a rumor using SIRS type epidemiological models with temporary immunity and nonlinear incidence rate. In particular, we speculate about…

We introduce kinetic models to simulate epidemic spread while accounting for individuals' opinions on protective behaviors. Opinion exchanges occur on a social network represented by a graphon, leading to scenarios with or without opinion…

We consider a class of Nash games, termed as aggregative games, being played over a networked system. In an aggregative game, a player's objective is a function of the aggregate of all the players' decisions. Every player maintains an…

Rumor spreading is a ubiquitous phenomenon in social and technological networks. Traditional models consider that the rumor is propagated by pairwise interactions between spreaders and ignorants. Spreaders can become stiflers only after…

Misinformation and rumor can spread rapidly and widely through online social networks and therefore rumor controlling has become a critical issue. It is often assumed that there is a single authority whose goal is to minimize the spread of…

This paper focuses on studying and understanding of stochastic dynamics in population composition when the population is subject to rumor spreading. We undertake the study by first developing an individual…

One major function of social networks (e.g., massive online social networks) is the dissemination of information such as scientific knowledge, news, and rumors. Information can be propagated by the users of the network via natural…