For Publishers
DiscoveryMetadataPeer reviewHostingPublishing
For Researchers
JoinPublishReviewCollect
Register
Blog
About
Search
Advanced search
My ScienceOpen
Search
For Publishers
For Researchers
Blog
About
48
views
88
references
 Top references
cited by
8
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      352
      similar
       All similar
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Axelrod's Metanorm Games on Networks

      research-article
      Author(s): 1 , 2 , * , 3 , 3
      Editor(s):
      Publication date (Electronic):
      Journal: PLoS ONE
      Publisher: Public Library of Science

      Read this article at

      ScienceOpenPublisherPMC
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Metanorms is a mechanism proposed to promote cooperation in social dilemmas. Recent experimental results show that network structures that underlie social interactions influence the emergence of norms that promote cooperation. We generalize Axelrod's analysis of metanorms dynamics to interactions unfolding on networks through simulation and mathematical modeling. Network topology strongly influences the effectiveness of the metanorms mechanism in establishing cooperation. In particular, we find that average degree, clustering coefficient and the average number of triplets per node play key roles in sustaining or collapsing cooperation.

          Related collections

          Most cited references88

          • Record: found
          • Abstract: found
          • Article: not found

          Emergence of scaling in random networks

          Zoltan Barabasi, Albert Donnay, Albert Dionise … (1999)
          Systems as diverse as genetic networks or the World Wide Web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature was found to be a consequence of two generic mechanisms: (i) networks expand continuously by the addition of new vertices, and (ii) new vertices attach preferentially to sites that are already well connected. A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
          Article 0 comments Cited 642 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found

            A simple rule for the evolution of cooperation on graphs and social networks.

            Hisashi Ohtsuki, Christoph Hauert, Erez Lieberman … (2006)
            A fundamental aspect of all biological systems is cooperation. Cooperative interactions are required for many levels of biological organization ranging from single cells to groups of animals. Human society is based to a large extent on mechanisms that promote cooperation. It is well known that in unstructured populations, natural selection favours defectors over cooperators. There is much current interest, however, in studying evolutionary games in structured populations and on graphs. These efforts recognize the fact that who-meets-whom is not random, but determined by spatial relationships or social networks. Here we describe a surprisingly simple rule that is a good approximation for all graphs that we have analysed, including cycles, spatial lattices, random regular graphs, random graphs and scale-free networks: natural selection favours cooperation, if the benefit of the altruistic act, b, divided by the cost, c, exceeds the average number of neighbours, k, which means b/c > k. In this case, cooperation can evolve as a consequence of 'social viscosity' even in the absence of reputation effects or strategic complexity.
            Article 0 comments Cited 571 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              The Pure Theory of Public Expenditure

              Paul A. Samuelson (1954)
              Article 0 comments Cited 558 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and article information

                Contributors
                : Role: Editor
                Journal
                Journal ID (nlm-ta): PLoS One
                Journal ID (publisher-id): plos
                Journal ID (pmc): plosone
                Title: PLoS ONE
                Publisher: Public Library of Science (San Francisco, USA )
                ISSN (Electronic): 1932-6203
                Publication date Collection: 2011
                Publication date (Electronic): 31 May 2011
                Volume: 6
                Issue: 5
                Electronic Location Identifier: e20474
                Affiliations
                [1 ]Área de Organización de Empresas, Departamento de Ingeniería Civil, Universidad de Burgos, Burgos, Spain
                [2 ]Social Systems Engineering Centre INSISOC, Valladolid, Spain
                [3 ]Department of Computational Social Science, George Mason University, Fairfax, Virginia, United States of America
                University of Maribor, Slovenia
                Author notes

                Conceived and designed the experiments: JMG MML SMR. Performed the experiments: JMG MML SMR. Analyzed the data: JMG MML SMR. Contributed reagents/materials/analysis tools: JMG MML SMR. Wrote the paper: JMG MML SMR.

                Article
                Publisher ID: PONE-D-11-05990
                DOI: 10.1371/journal.pone.0020474
                PMC ID: 3105066
                PubMed ID: 21655211
                SO-VID: d319a2d4-621e-47dc-ba50-7f713c492dc5
                Copyright © Galán et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
                History
                Date received : 31 March 2011
                Date accepted : 26 April 2011
                Page count
                Pages: 11
                Categories
                Subject: Research Article
                Subject: Biology
                Subject: Computational Biology
                Subject: Evolutionary Modeling
                Subject: Computer Science
                Subject: Computer Modeling
                Subject: Mathematics
                Subject: Applied Mathematics
                Subject: Complex Systems
                Subject: Game Theory
                Subject: Social and Behavioral Sciences
                Subject: Economics
                Subject: Sociology
                Subject: Computational Sociology

                ScienceOpen disciplines: Uncategorized
                Data availability:
                ScienceOpen disciplines: Uncategorized

                Comments

                Comment on this article

                scite_

                Similar content352

                See all similar

                Cited by8

                See all cited by

                Most referenced authors525

                See all reference authors