Imitation dynamics in population games on community networks

09/21/2020
by   Giacomo Como, et al.
0

We study the asymptotic behavior of deterministic, continuous-time imitation dynamics for population games over networks. The basic assumption of this learning mechanism – encompassing the replicator dynamics – is that players belonging to a single population exchange information through pairwise interactions, whereby they get aware of the actions played by the other players and the corresponding rewards. Using this information, they can revise their current action, imitating the one of the players they interact with. The pattern of interactions regulating the learning process is determined by a community structure. First, the set of equilibrium points of such network imitation dynamics is characterized. Second, for the class of potential games and for undirected and connected community networks, global asymptotic convergence is proved. In particular, our results guarantee convergence to a Nash equilibrium from every fully supported initial population state in the special case when the Nash equilibria are isolated and fully supported. Examples and numerical simulations are offered to validate the theoretical results and counterexamples are discussed for scenarios when the assumptions on the community structure are not verified.

READ FULL TEXT

page 1

page 12

research
03/06/2018

On stochastic imitation dynamics in large-scale networks

We consider a broad class of stochastic imitation dynamics over networks...
research
01/11/2021

Best-response dynamics in directed network games

We study public goods games played on networks with possibly non-recipro...
research
03/01/2022

Population games on dynamic community networks

In this letter, we deal with evolutionary game theoretic learning proces...
research
05/23/2023

Memory Asymmetry Creates Heteroclinic Orbits to Nash Equilibrium in Learning in Zero-Sum Games

Learning in games considers how multiple agents maximize their own rewar...
research
07/14/2022

A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games

Since the seminal PPAD-completeness result for computing a Nash equilibr...
research
09/21/2020

Optimal Targeting in Super-Modular Games

We study an optimal targeting problem for super-modular games with binar...
research
10/15/2019

Games of Incomplete Information Played By Statisticians

This paper proposes a foundation for heterogeneous beliefs in games, in ...

Please sign up or login with your details

Forgot password? Click here to reset