Open AccessThe role of self-loops and link removal in evolutionary games on networks
Author(s) -
Dario Madeo,
Chiara Mocenni,
Jean Carlo Moraes,
Jorge P. Zubelli
Publication year - 2019
Publication title -
mathematical biosciences and engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.451
H-Index - 45
eISSN - 1551-0018
pISSN - 1547-1063
DOI - 10.3934/mbe.2019264
Subject(s) - network topology , link (geometry) , computer science , graph , context (archaeology) , game theory , mathematical economics , topology (electrical circuits) , theoretical computer science , mathematical optimization , mathematics , computer network , combinatorics , paleontology , biology
Recently, a new mathematical formulation of evolutionary game dynamics [1] has been introduced accounting for a finite number of players organized over a network, where the players are located at the nodes of a graph and edges represent connections between them. Internal steady states are particularly interesting in control and consensus problems, especially in a networked context where they are related to the coexistence of different strategies. In this paper we consider this model including self-loops. Existence of internal steady states is studied for different graph topologies in two-strategy games. Results on the effect of removing links from central players are also presented.