Belief and Opinion Evolution in Social Networks: A High-Dimensional Mean Field Game Approach

Author(s):  
Hao Gao ◽  
Alex Lin ◽  
Reginald A. Banez ◽  
Wuchen Li ◽  
Zhu Han ◽  
...  
Author(s):  
Sarah Perrin ◽  
Mathieu Laurière ◽  
Julien Pérolat ◽  
Matthieu Geist ◽  
Romuald Élie ◽  
...  

We present a method enabling a large number of agents to learn how to flock. This problem has drawn a lot of interest but requires many structural assumptions and is tractable only in small dimensions. We phrase this problem as a Mean Field Game (MFG), where each individual chooses its own acceleration depending on the population behavior. Combining Deep Reinforcement Learning (RL) and Normalizing Flows (NF), we obtain a tractable solution requiring only very weak assumptions. Our algorithm finds a Nash Equilibrium and the agents adapt their velocity to match the neighboring flock’s average one. We use Fictitious Play and alternate: (1) computing an approximate best response with Deep RL, and (2) estimating the next population distribution with NF. We show numerically that our algorithm can learn multi-group or high-dimensional flocking with obstacles.


2021 ◽  
pp. 113-145
Author(s):  
Reginald A. Banez ◽  
Lixin Li ◽  
Chungang Yang ◽  
Zhu Han

Author(s):  
Josu Doncel ◽  
Nicolas Gast ◽  
Bruno Gaujal

We analyze a mean field game model of SIR dynamics (Susceptible, Infected, and Recovered) where players choose when to vaccinate. We show that this game admits a unique mean field equilibrium (MFE) that consists in vaccinating at a maximal rate until a given time and then not vaccinating. The vaccination strategy that minimizes the total cost has the same structure as the MFE. We prove that the vaccination period of the MFE is always smaller than the one minimizing the total cost. This implies that, to encourage optimal vaccination behavior, vaccination should always be subsidized. Finally, we provide numerical experiments to study the convergence of the equilibrium when the system is composed by a finite number of agents ( $N$ ) to the MFE. These experiments show that the convergence rate of the cost is $1/N$ and the convergence of the switching curve is monotone.


Author(s):  
Erhan Bayraktar ◽  
Yuchong Zhang

We analyze a mean field tournament: a mean field game in which the agents receive rewards according to the ranking of the terminal value of their projects and are subject to cost of effort. Using Schrödinger bridges we are able to explicitly calculate the equilibrium. This allows us to identify the reward functions which would yield a desired equilibrium and solve several related mechanism design problems. We are also able to identify the effect of reward inequality on the players’ welfare as well as calculate the price of anarchy.


Sign in / Sign up

Export Citation Format

Share Document