Evolving networks for social optima in the "weakest link game"

1Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Previous models have applied evolving networks based on node-level "copy and rewire" rules to simple two player games (e.g. the Prisoner's Dilemma). It was found that such models tended to evolve toward socially optimal behavior. Here we apply a similar technique to a more tricky co-ordination game (the weakest link game) requiring interactions from several players (nodes) that may play several strategies. We define a variant of the game with several equilibria-each offering increasing social benefit. We found that the evolving network functions to select and spread more optimal equilibria while resisting invasion by lower ones. Hence the network acts as a kind of "social ratchet" selecting for increasing social benefit. Such networks have applications in peer-to-peer computing and may have implications for understanding social systems. © Springer Science+Business Media, LLC 2008.

Cite

CITATION STYLE

APA

Rossi, G., Arteconi, S., & Hales, D. (2009). Evolving networks for social optima in the “weakest link game.” In Computational and Mathematical Organization Theory (Vol. 15, pp. 95–108). https://doi.org/10.1007/s10588-008-9051-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free