The role of self-loops and link removal in evolutionary games on networks
| Autor: | Chiara Mocenni, Jean Carlo Moraes, Dario Madeo, Jorge P. Zubelli |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Computer Science::Computer Science and Game Theory
Theoretical computer science Equilibrium states Computer science Evolutionary game theory 02 engineering and technology Competition Connectivity of networks Cooperation Games on graphs Games on networks Self-loops on graphs Network topology 0502 economics and business 0202 electrical engineering electronic engineering information engineering Evolutionary game dynamics Finite set Applied Mathematics 05 social sciences General Medicine Graph Computational Mathematics Modeling and Simulation 020201 artificial intelligence & image processing General Agricultural and Biological Sciences 050203 business & management |
| Zdroj: | Mathematical Biosciences and Engineering. 16:5287-5306 |
| ISSN: | 1551-0018 |
| DOI: | 10.3934/mbe.2019264 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|