The Survival of the Weakest in Networks
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.
KeywordsPolynomial Time Initial Position Directed Graph Undirected Graph Replicator Dynamic
Unable to display preview. Download preview PDF.
- 5.Nikoletseas, S., Raptopoulos, C., Spirakis, P.: The Survival of the Weakest in Networks, http://students.ceid.upatras.gr/~raptopox/HawksandDoves.ps
- 7.Ross, S.: Probability Models for Computer Science. Harcourt Academic Press, London (2000)Google Scholar
- 8.Samuelson, L.: Evolutionary Games and Equilibrium Selection. MIT Press, Cambridge Google Scholar
- 9.Tetali, P., Winkler, P.: On a random walk problem arising in self-stabilizing token management. In: Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, pp. 273–280 (1991)Google Scholar
- 10.Weibull, J.W.: Evolutionary Game Theory. MIT Press, Cambridge Google Scholar