Modeling Confrontations in Complex Networks Based on Game Theory

摘要

To fully understand the structure robustness of complex networks where confrontations of attackers and defenders happen, we build a game model which is a zero-sum game in simultaneous form. We assume that the attack and defense are only against the top-n vital nodes and evaluate the payoffs using the full information of the network. A mapping process is introduced which maps the probabilities of pure strategies onto nodes. The experimental results in random scale-free networks reveals that the attacker pay more emphasis on attacking the nodes with relatively small degrees while the defender allocates more resource to nodes which play a more important role in maintaining the connectivity of the network.