The survival of the weakest in networks

DOI10.1007/S10588-008-9050-2zbMath1167.91327OpenAlexW2159179957MaRDI QIDQ2272242

Christoforos L. Raptopoulos, Paul G. Spirakis, Sotiris E. Nikoletseas

Publication date: 6 August 2009

Published in: Computational \& Mathematical Organization Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10588-008-9050-2

zbMATH Keywords

game theorycompetitionrandom walksnetworkssocial networksdistributed computingevolutionary gamesnetwork sciencegenerative modelsgames on networksnetwork evolution

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Communication networks in operations research (90B18) Games involving graphs (91A43)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Meeting times of random walks on graphs
• The long-run behavior of the stochastic replicator dynamics
• Markov Chains
• On a random walk problem arising in self-stabilizing token management
• Learning, Mutation, and Long Run Equilibria in Games

This page was built for publication: The survival of the weakest in networks