Cooperation in public goods games: stay, but not for too long (Q1656963)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6916610
Language Label Description Also known as
default for all languages
No label defined
    English
    Cooperation in public goods games: stay, but not for too long
    scientific article; zbMATH DE number 6916610

      Statements

      Cooperation in public goods games: stay, but not for too long (English)
      0 references
      0 references
      0 references
      0 references
      13 August 2018
      0 references
      Summary: Cooperation in repeated public goods game is hardly achieved, unless contingent behavior is present. Surely, if mechanisms promoting positive assortment between cooperators are present, then cooperators may beat defectors, because cooperators would collect greater payoffs. In the context of evolutionary game theory, individuals that always cooperate cannot win the competition against defectors in well-mixed populations. Here, we study the evolution of a population where fitness is obtained in repeated public goods games and players have a fixed probability of playing the next round. As a result, the group size decreases during the game. The population is well-mixed and there are only two available strategies: always cooperate (ALLC) or always defect (ALLD). Through numerical calculation and analytical approximations we show that cooperation can emerge if the players stay playing the game, but not for too long. The essential mechanism is the interaction between the transition from strong to weak altruism, as the group size decreases, and the existence of an upper limit to the number of rounds representing limited time availability.
      0 references
      evolutionary game theory
      0 references
      public goods game
      0 references
      repeated games
      0 references
      fixation probability
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references