The role of self-loops and link removal in evolutionary games on networks.

Clicks: 291
ID: 44947
2019
Article Quality & Performance Metrics
Overall Quality Improving Quality
0.0 /100
Combines engagement data with AI-assessed academic quality
AI Quality Assessment
Not analyzed
Abstract
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.
Reference Key
madeo2019themathematical Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Madeo, Dario;Mocenni, Chiara;Moraes, Jean Carlo;Zubelli, Jorge P;
Journal mathematical biosciences and engineering : mbe
Year 2019
DOI
10.3934/mbe.2019264
URL
Keywords
cooperation competition connectivity of networks equilibrium states evolutionary game theory games on graphs games on networks self-loops on graphs

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.