Narrow Results

Evolution of cooperation has attracted considerable attention but so far no definitive answer exists. Probably each kind of problem has specific answers. This paper deals with evolution of cooperation in public goods games. We use random Boolean networks to formalize the non-local influence of K agents over a given agent. This formalism allows the representation of a variety of network regulation mechanisms by means of (i) different topologies and (ii) Boolean functions that do the regulation proper. However, random functions and connections do not necessarily lead to cooperation. Thus, it is necessary to find what kind of network structure is prone to promote cooperation. We employ an evolutionary approach to show that evolving the topologies and the random functions leads to much fitter structures.