Cooperation in scale-free networks with limited associative capacities

In this work we study the effect of limiting the number of interactions (the associative capacity) that a node can establish per round of a prisoner's dilemma game. We focus on the way this limitation influences the level of cooperation sustained by scale-free networks. We show that when the game includes cooperation costs, limiting the associative capacity of nodes to a fixed quantity renders in some cases larger values of cooperation than in the unrestricted scenario. This allows one to define an optimum capacity for which cooperation is maximally enhanced. Finally, for the case without cooperation costs, we find that even a tight limitation of the associative capacity of nodes yields the same levels of cooperation as in the original network.