EUVIMEDEUVIMED entdecken
Crossref

Coevolution of relationship and interaction in cooperative dynamical multiplex networks

Xiaojin Xiong iD, Ziyan Zeng iD, Minyu Feng iD, Attila Szolnoki iD

Chaos: An Interdisciplinary Journal of Nonlinear Science · 01.02.2024 · 34 (2)

DOI: 10.1063/5.0188168 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Chaos: An Interdisciplinary Journal of Nonlinear Science, online erschienen am 14.02.2024. Verfasst von Xiaojin Xiong und 3 weiteren Autor:innen. Beteiligte Einrichtung: The College of Artificial Intelligence, Southwest University, No.2 Tiansheng Road, Beibei, Chongqing 400715, China. Die Arbeit wurde bisher 39-mal zitiert (Crossref) und nennt 44 Literaturangaben. Gefördert von: Humanities and Social Science Fund of Ministry of Education of China, Nature Science Foundation of Chongqing Municipality, National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

While actors in a population can interact with anyone else freely, social relations significantly influence our inclination toward particular individuals. The consequence of such interactions, however, may also form the intensity of our relations established earlier. These dynamical processes are captured via a coevolutionary model staged in multiplex networks with two distinct layers. In a so-called relationship layer, the weights of edges among players may change in time as a consequence of games played in the alternative interaction layer. As an reasonable assumption, bilateral cooperation confirms while mutual defection weakens these weight factors. Importantly, the fitness of a player, which basically determines the success of a strategy imitation, depends not only on the payoff collected from interactions, but also on the individual relationship index calculated from the mentioned weight factors of related edges. Within the framework of weak prisoner’s dilemma situation, we explore the potential outcomes of the mentioned coevolutionary process where we assume different topologies for relationship layer. We find that higher average degree of the relationship graph is more beneficial to maintain cooperation in regular graphs, but the randomness of links could be a decisive factor in harsh situations. Surprisingly, a stronger coupling between relationship index and fitness discourage the evolution of cooperation by weakening the direct consequence of a strategy change. To complete our study, we also monitor how the distribution of relationship index vary and detect a strong relation between its polarization and the general cooperation level.

Autor:innen und Institutionen

  • The College of Artificial Intelligence, Southwest University, No.2 Tiansheng Road, Beibei, Chongqing 400715, China.
  • Institute of Technical Physics and Materials Science, Centre for Energy Research, P.O. Box 49, H-1525 Budapest, Hungary.

ORCID-Profile: Xiaojin Xiong, Ziyan Zeng, Minyu Feng, Attila Szolnoki

Förderung

  • Humanities and Social Science Fund of Ministry of Education of China
  • Nature Science Foundation of Chongqing Municipality
  • National Natural Science Foundation of China
  • National Research, Development and Innovation Office

Zitieren

APA

Xiong, X., Zeng, Z., Feng, M., & Szolnoki, A. (2024). Coevolution of relationship and interaction in cooperative dynamical multiplex networks. Chaos: An Interdisciplinary Journal of Nonlinear Science, 34(2). https://doi.org/10.1063/5.0188168

Vancouver

Xiong X, Zeng Z, Feng M, Szolnoki A. Coevolution of relationship and interaction in cooperative dynamical multiplex networks. Chaos: An Interdisciplinary Journal of Nonlinear Science. 2024;34(2). doi:10.1063/5.0188168

BibTeX
@article{Xiong2024,
  author = {Xiong, Xiaojin and Zeng, Ziyan and Feng, Minyu and Szolnoki, Attila},
  title = {Coevolution of relationship and interaction in cooperative dynamical multiplex networks},
  journal = {Chaos: An Interdisciplinary Journal of Nonlinear Science},
  year = {2024},
  volume = {34},
  number = {2},
  doi = {10.1063/5.0188168}
}
Kostenlos starten →