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

Clicks: 397
ID: 44947
2019
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #2 of 23 articles by views in mathematical biosciences and engineering : mbe

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
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

Citations

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

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