umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Diversity-optimized cooperation on complex networks
Department of Modern Physics, University of Science and Technology of China, Hefei 230026, China.
Department of Electrical Engineering, Arizona State University, Tempe, Arizona 85287, USA.
Umeå University, Faculty of Science and Technology, Physics.
Department of Electrical Engineering, Arizona State University, Tempe, Arizona 85287, USA.
Show others and affiliations
2009 (English)In: Physical Review E. Statistical, Nonlinear, and Soft Matter Physics: Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics, ISSN 1063-651X, E-ISSN 1095-3787, Vol. 79, no 5, 056107- p.Article in journal (Refereed) Published
Abstract [en]

We propose a strategy for achieving maximum cooperation in evolutionary games on complex networks. Each individual is assigned a weight that is proportional to the power of its degree, where the exponent α is an adjustable parameter that controls the level of diversity among individuals in the network. During the evolution, every individual chooses one of its neighbors as a reference with a probability proportional to the weight of the neighbor, and updates its strategy depending on their payoff difference. It is found that there exists an optimal value of α, for which the level of cooperation reaches maximum. This phenomenon indicates that, although high-degree individuals play a prominent role in maintaining the cooperation, too strong influences from the hubs may counterintuitively inhibit the diffusion of cooperation. Other pertinent quantities such as the payoff, the cooperator density as a function of the degree, and the payoff distribution are also investigated computationally and theoretically. Our results suggest that in order to achieve strong cooperation on a complex network, individuals should learn more frequently from neighbors with higher degrees, but only to a certain extent.

Place, publisher, year, edition, pages
American physical society , 2009. Vol. 79, no 5, 056107- p.
Identifiers
URN: urn:nbn:se:umu:diva-30938DOI: 10.1103/PhysRevE.79.056107OAI: oai:DiVA.org:umu-30938DiVA: diva2:288988
Available from: 2010-01-25 Created: 2010-01-22 Last updated: 2017-12-12Bibliographically approved

Open Access in DiVA

fulltext(341 kB)302 downloads
File information
File name FULLTEXT01.pdfFile size 341 kBChecksum SHA-512
dfd3b962d1496dbfa9fed2a37b0705094daf3f5398a8d9d64ab3e37519ae0c072bb1b9fbb32cd5914f35291d53efa5cc4406ec95189fb960d204808ddb9ec016
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Wu, Zhi-Xi
By organisation
Physics
In the same journal
Physical Review E. Statistical, Nonlinear, and Soft Matter Physics: Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

Search outside of DiVA

GoogleGoogle Scholar
Total: 302 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 103 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf