Robustness of cooperation on scale-free networks under continuous topological change.

In this paper, we numerically investigate the robustness of cooperation clusters in prisoner's dilemma played on scale-free networks, where the network topologies change by continuous removal and addition of nodes. Each removal and addition can be either random or intentional. We therefore have four different strategies in changing network topology: random removal and random addition (RR), random removal and preferential addition (RP), targeted removal and random addition (TR), and targeted removal and preferential addition (TP).