Abstract
The evolution of interactions between individuals or organizations are a central theme of complexity research. We aim at modeling a dynamic game on a network where an attacker and a defender compete in disrupting and reconnecting a network. The choices of how to attack and defend the network are governed by a Genetic Algorithm (GA) which is used to dynamically choose among a set of available strategies. Our analysis shows that the choice of strategy is particularly important if the resources available to the defender are slightly higher than the attackers’. The best strategies found through GAs by the attackers and defenders are based on betweenness centrality. Our results agree with previous literature assessing strategies for network attack and defense in a static context. However, our paper is one of the first ones to show how a GA approach can be applied in a dynamic game on a network. This research provides a starting-point to further explore strategies as we currently apply a limited set of strategies only.
The authors have evenly contributed to the work presented in the paper.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albert, R., Albert, I., Nakarado, G.: Structural vulnerability of the north american power grid. Physical Review EÂ 69 (2004)
Albert, R., Jeong, H., Barabási, A.L.: Error and attack tolerance of complex networks. Nature 406(6794), 378–382 (2000)
Boss, M., Elsinger, H., Summer, M., Thurner, S.: The network topology of the interbank market. Quantitative Finance 4, 677–684 (2004)
Colizza, V., Barrat, A., Barthélemy, M., Vespignani, A.: Predictability and epidemic pathways in global outbreaks of infectious diseases: the sars case study. BMC Med. 5, 34 (2007)
Domingo-Ferrer, J., Gonzlez-Nicols, R.: Decapitation of networks with and without weights and direction: The economics of iterated attack an d defense. Computer Networks 55(1), 119–130 (2011)
Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. Urbana 51, 61801–62996
Guimerà , R., Mossa, S., Turtschi, A., Amaral, L.A.N.: The worldwide air transportation network: Anomalous centrality, community structure, and cities’ global roles. PNAS 102(22), 7794–7799 (2005)
Holme, P., Kim, B.J., Yoon, C.N., Han, S.K.: Attack vulnerability of complex networks. Physical Review EÂ 65(5), 056109 (2002)
Iyer, S., Killingback, T., Sundaram, B., Wang, Z.: Attack robustness and centrality of complex networks. PloS One 8(4), e59613 (2013)
Jeong, H., Tombor, B., Albert, R., Oltvai, Z.N., Barabási, A.L.: The large-scale organization of metabolic networks. Nature 407(6804), 651–654 (2000)
Kim, H., Anderson, R.: An experimental evaluation of robustness of networks. IEEE Systems Journal 7(2), 179–188 (2013)
Krebs, V.E.: Mapping networks of terrorist cells. Connections 24(3), 43–52 (2002)
Latora, V., Marchiori, M.: Is the boston subway a small-world network? Physica A: Statistical Mechanics and its Applications 314(1-4), 109–113 (2002)
Nagaraja, S.: Topology of covert conflict. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Security Protocols 2005. LNCS, vol. 4631, pp. 329–332. Springer, Heidelberg (2007)
Nagaraja, S., Anderson, R.: The topology of covert conflict. Technical Report UCAM-CL-TR-637, University of Cambridge, Computer Laboratory (July 2005)
Newman, M.: Networks: an introduction. Oxford University Press (2009)
Pagani, G.A., Aiello, M.: The power grid as a complex network: A survey. Physica A: Statistical Mechanics and its Applications 392(11), 2688–2700 (2013)
Travers, J., Milgram, S.: An experimental study of the small world problem. Sociometry 32(4), 425–443 (1969)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Arnold, H., Masad, D., Pagani, G.A., Schmidt, J., Stepanova, E. (2014). Network Disruption and Recovery: Co-Evolution of Defender and Attacker in a Dynamic Game. In: Contucci, P., Menezes, R., Omicini, A., Poncela-Casasnovas, J. (eds) Complex Networks V. Studies in Computational Intelligence, vol 549. Springer, Cham. https://doi.org/10.1007/978-3-319-05401-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-05401-8_14
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05400-1
Online ISBN: 978-3-319-05401-8
eBook Packages: EngineeringEngineering (R0)