The survival of the weakest in networks

S. Nikoletseas (), C. Raptopoulos () and P. Spirakis ()
Additional contact information
S. Nikoletseas: Computer Technology Institute
C. Raptopoulos: Computer Technology Institute
P. Spirakis: Computer Technology Institute

Computational and Mathematical Organization Theory, 2009, vol. 15, issue 2, No 6, 127-146

Abstract: Abstract We study here dynamic antagonism in a fixed network, represented as a graph G of n vertices. In particular, we consider the case of k≤n particles walking randomly independently around the network. Each particle belongs to exactly one of two antagonistic species, none of which can give birth to children. When two particles meet, they are engaged in a (sometimes mortal) local fight. The outcome of the fight depends on the species to which the particles belong. Our problem is to predict (i.e. to compute) the eventual chances of species survival. We prove here that this can indeed be done in expected polynomial time on the size of the network, provided that the network is undirected.

Keywords: Networks; Distributed computing; Random walks; Evolutionary games; Game theory; Games on networks; Network science; Generative models; Network evolution; Social networks; Competition (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10588-008-9050-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:comaot:v:15:y:2009:i:2:d:10.1007_s10588-008-9050-2

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10588

DOI: 10.1007/s10588-008-9050-2

Access Statistics for this article

Computational and Mathematical Organization Theory is currently edited by Terrill Frantz and Kathleen Carley

More articles in Computational and Mathematical Organization Theory from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().