{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T00:10:06Z","timestamp":1769731806975,"version":"3.49.0"},"reference-count":66,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2019,12,10]],"date-time":"2019-12-10T00:00:00Z","timestamp":1575936000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2015\/17\/N\/ST6\/03686, 2016\/23\/B\/ST6\/03599"],"award-info":[{"award-number":["2015\/17\/N\/ST6\/03686, 2016\/23\/B\/ST6\/03599"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Cooperative Agreement between the Masdar Institute of Science and Technology (Masdar Institute), Abu Dhabi, UAE and the Massachusetts Institute of Technology (MIT), Cambridge, MA, USA","award":["02\/MI\/MIT\/CP\/11\/07633\/GEN\/G\/00"],"award-info":[{"award-number":["02\/MI\/MIT\/CP\/11\/07633\/GEN\/G\/00"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2020,2,29]]},"abstract":"<jats:p>Security games model the confrontation between a defender protecting a set of targets and an attacker who tries to capture them. A variant of these games assumes security interdependence between targets, facilitating contagion of an attack. So far, only stochastic spread of an attack has been considered. In this work, we introduce a version of security games, where the attacker strategically drives the entire spread of attack and where interconnections between nodes affect their susceptibility to be captured.<\/jats:p>\n          <jats:p>We find that the strategies effective in the settings without contagion or with stochastic contagion are no longer feasible when spread of attack is strategic. While in the former settings it was possible to efficiently find optimal strategies of the attacker, doing so in the latter setting turns out to be an NP-complete problem for an arbitrary network. However, for some simpler network structures, such as cliques, stars, and trees, we show that it is possible to efficiently find optimal strategies of both players. For arbitrary networks, we study and compare the efficiency of various heuristic strategies. As opposed to previous works with no or stochastic contagion, we find that centrality-based defense is often effective when spread of attack is strategic, particularly for centrality measures based on the Shapley value.<\/jats:p>","DOI":"10.1145\/3357605","type":"journal-article","created":{"date-parts":[[2019,12,10]],"date-time":"2019-12-10T13:21:36Z","timestamp":1575984096000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Strategic Attack &amp; Defense in Security Diffusion Games"],"prefix":"10.1145","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2864-6909","authenticated-orcid":false,"given":"Marcin","family":"Waniek","sequence":"first","affiliation":[{"name":"Computer Science Department, New York University, UAE and Masdar Institute, Khalifa University of Science and Technology, UAE and Institute of Informatics, University of Warsaw, Banacha, Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz P.","family":"Michalak","sequence":"additional","affiliation":[{"name":"Institute of Informatics, University of Warsaw, Banacha, Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aamena","family":"Alshamsi","sequence":"additional","affiliation":[{"name":"Masdar Institute, Khalifa University of Science and Technology, Abu Dhabi, UAE"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,12,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2016.09.009"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-018-03740-9"},{"key":"e_1_2_1_3_1","volume-title":"The rush in a directed graph. Stichting Mathematisch Centrum. Mathematische Besliskunde BN 9\/71","author":"Anthonisse Jac M.","year":"1971","unstructured":"Jac M. Anthonisse . 1971. The rush in a directed graph. Stichting Mathematisch Centrum. Mathematische Besliskunde BN 9\/71 ( 1971 ), 1--10. Jac M. Anthonisse. 1971. The rush in a directed graph. Stichting Mathematisch Centrum. Mathematische Besliskunde BN 9\/71 (1971), 1--10."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.2307\/2234208"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736686"},{"key":"e_1_2_1_6_1","volume-title":"Emergence of scaling in random networks. Science 286, 5439","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"1999","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert . 1999. Emergence of scaling in random networks. Science 286, 5439 ( 1999 ), 509--512. Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert. 1999. Emergence of scaling in random networks. Science 286, 5439 (1999), 509--512."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/bs.3830100205"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1086\/261849"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the IEEE 2nd International Conference on Social Computing (SocialCom\u201910)","author":"Broecheler Matthias","unstructured":"Matthias Broecheler , Paulo Shakarian , and V. S. Subrahmanian . 2010. A scalable framework for modeling competitive diffusion in social networks . In Proceedings of the IEEE 2nd International Conference on Social Computing (SocialCom\u201910) . IEEE, Piscataway, NJ, 295--302. Matthias Broecheler, Paulo Shakarian, and V. S. Subrahmanian. 2010. A scalable framework for modeling competitive diffusion in social networks. In Proceedings of the IEEE 2nd International Conference on Social Computing (SocialCom\u201910). IEEE, Piscataway, NJ, 295--302."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1037\/h0087852"},{"key":"e_1_2_1_11_1","volume-title":"The spread of behavior in an online social network experiment. Science 329, 5996","author":"Centola Damon","year":"2010","unstructured":"Damon Centola . 2010. The spread of behavior in an online social network experiment. Science 329, 5996 ( 2010 ), 1194--1197. Damon Centola. 2010. The spread of behavior in an online social network experiment. Science 329, 5996 (2010), 1194--1197."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1207055"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1086\/521848"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1756-2171.2010.00116.x"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/130936580"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.65.055103"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the European Starting AI Researcher Symposium (STAIRS\u201914)","author":"Durkota Karel","year":"2014","unstructured":"Karel Durkota and Viliam Lis\u1ef3 . 2014 . Computing optimal policies for attack graphs with action failures and costs . In Proceedings of the European Starting AI Researcher Symposium (STAIRS\u201914) . IOS Press, 101--110. Karel Durkota and Viliam Lis\u1ef3. 2014. Computing optimal policies for attack graphs with action failures and costs. In Proceedings of the European Starting AI Researcher Symposium (STAIRS\u201914). IOS Press, 101--110."},{"key":"e_1_2_1_18_1","first-page":"331","article-title":"How do you defend a network?Theoret","volume":"12","author":"Dziubi\u0144ski Marcin","year":"2017","unstructured":"Marcin Dziubi\u0144ski and Sanjeev Goyal . 2017 . How do you defend a network?Theoret . Econ. 12 , 1 (2017), 331 -- 376 . Marcin Dziubi\u0144ski and Sanjeev Goyal. 2017. How do you defend a network?Theoret. Econ. 12, 1 (2017), 331--376.","journal-title":"Econ."},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs I","volume":"6","author":"Erd\u0151s Paul","year":"1959","unstructured":"Paul Erd\u0151s and Alfr\u00e9d R\u00e9nyi . 1959 . On random graphs I . Publ. Math. Debrecen 6 (1959), 290 -- 297 . Paul Erd\u0151s and Alfr\u00e9d R\u00e9nyi. 1959. On random graphs I. Publ. Math. Debrecen 6 (1959), 290--297.","journal-title":"Publ. Math. Debrecen"},{"key":"e_1_2_1_20_1","volume-title":"Competition, Innovation, and Antitrust: A Theory of Market Leaders and Its Policy Implications","author":"Etro Federico","unstructured":"Federico Etro . 2007. Stackelberg competition and endogenous entry . In Competition, Innovation, and Antitrust: A Theory of Market Leaders and Its Policy Implications . Springer , Berlin , 91--129. Federico Etro. 2007. Stackelberg competition and endogenous entry. In Competition, Innovation, and Antitrust: A Theory of Market Leaders and Its Policy Implications. Springer, Berlin, 91--129."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jfin.1998.0230"},{"key":"e_1_2_1_23_1","first-page":"634","article-title":"Customer poaching and brand switching","volume":"31","author":"Fudenberg Drew","year":"2000","unstructured":"Drew Fudenberg and Jean Tirole . 2000 . Customer poaching and brand switching . J. Econ. 31 (2000), 634 -- 657 . Drew Fudenberg and Jean Tirole. 2000. Customer poaching and brand switching. J. Econ. 31 (2000), 634--657.","journal-title":"J. Econ."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1093\/restud\/rdu013"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpubeco.2015.02.010"},{"key":"e_1_2_1_26_1","volume-title":"Hall and Beethika Khan","author":"Bronwyn","year":"2003","unstructured":"Bronwyn H. Hall and Beethika Khan . 2003 . Adoption of New Technology. Working Paper 9730. National Bureau of Economic Research . https:\/\/doi.org\/10.3386\/w9730 10.3386\/w9730 Bronwyn H. Hall and Beethika Khan. 2003. Adoption of New Technology. Working Paper 9730. National Bureau of Economic Research. https:\/\/doi.org\/10.3386\/w9730"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.4789679"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the International Conference on Machine Learning (ICML\u201998)","volume":"98","author":"Hu Junling","unstructured":"Junling Hu and Michael P. Wellman . 1998. Multiagent reinforcement learning: Theoretical framework and an algorithm . In Proceedings of the International Conference on Machine Learning (ICML\u201998) , Vol. 98 . Morgan Kaufmann Publishers Inc., Burlington, MA, 242--250. Junling Hu and Michael P. Wellman. 1998. Multiagent reinforcement learning: Theoretical framework and an algorithm. In Proceedings of the International Conference on Machine Learning (ICML\u201998), Vol. 98. Morgan Kaufmann Publishers Inc., Burlington, MA, 242--250."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/2806697.2806698"},{"key":"e_1_2_1_30_1","first-page":"891","article-title":"Balancing speed and coverage by sequential seeding in complex networks. Sci","volume":"7","author":"Jankowski Jaros\u0142aw","year":"2017","unstructured":"Jaros\u0142aw Jankowski , Piotr Br\u00f3dka , Przemys\u0142aw Kazienko , Boleslaw K. Szymanski , Rados\u0142aw Michalski , and Tomasz Kajdanowicz . 2017 . Balancing speed and coverage by sequential seeding in complex networks. Sci . Rep. 7 , 1 (2017), 891 . Jaros\u0142aw Jankowski, Piotr Br\u00f3dka, Przemys\u0142aw Kazienko, Boleslaw K. Szymanski, Rados\u0142aw Michalski, and Tomasz Kajdanowicz. 2017. Balancing speed and coverage by sequential seeding in complex networks. Sci. Rep. 7, 1 (2017), 891.","journal-title":"Rep."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0205130"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17197-0_16"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622737.1622748"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsif.2014.0694"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1509\/jm.74.2.71"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024119208153"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS\u201912)","author":"Leskovec Jure","unstructured":"Jure Leskovec and Julian J. Mcauley . 2012. Learning to discover social circles in ego networks . In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS\u201912) . 539--547. Jure Leskovec and Julian J. Mcauley. 2012. Learning to discover social circles in ego networks. In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS\u201912). 539--547."},{"key":"e_1_2_1_40_1","first-page":"704","article-title":"Cybercriminal networks, social ties, and online forums: Social ties versus digital ties within phishing and malware networks","volume":"57","author":"Leukfeldt E. Rutger","year":"2017","unstructured":"E. Rutger Leukfeldt , Edward R. Kleemans , and Wouter P. Stol . 2017 . Cybercriminal networks, social ties, and online forums: Social ties versus digital ties within phishing and malware networks . Brit. J. Criminol. 57 , 3 (2017), 704 -- 722 . E. Rutger Leukfeldt, Edward R. Kleemans, and Wouter P. Stol. 2017. Cybercriminal networks, social ties, and online forums: Social ties versus digital ties within phishing and malware networks. Brit. J. Criminol. 57, 3 (2017), 704--722.","journal-title":"Brit. J. Criminol."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2017.11"},{"key":"e_1_2_1_42_1","first-page":"519","article-title":"Destination marketing through user personalised content (UPC)","volume":"2010","author":"Matloka Joanna","year":"2010","unstructured":"Joanna Matloka and Dimitrios Buhalis . 2010 . Destination marketing through user personalised content (UPC) . Inform. Commun. Technol. Tour. 2010 (2010), 519 -- 530 . Joanna Matloka and Dimitrios Buhalis. 2010. Destination marketing through user personalised content (UPC). Inform. Commun. Technol. Tour. 2010 (2010), 519--530.","journal-title":"Inform. Commun. Technol. Tour."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/2512538.2512553"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/GAMENETS.2009.5137463"},{"key":"e_1_2_1_46_1","volume-title":"Proceedings of the International Joint Conference on Autonomous Agents 8 Multiagent Systems (AAMAS\u201908)","author":"Paruchuri Praveen","year":"2008","unstructured":"Praveen Paruchuri , Jonathan P. Pearce , Janusz Marecki , Milind Tambe , Fernando Ordonez , and Sarit Kraus . 2008 . Playing games for security: An efficient exact algorithm for solving Bayesian Stackelberg games . In Proceedings of the International Joint Conference on Autonomous Agents 8 Multiagent Systems (AAMAS\u201908) . IFAAMAS, Columbia, SC, 895--902. Praveen Paruchuri, Jonathan P. Pearce, Janusz Marecki, Milind Tambe, Fernando Ordonez, and Sarit Kraus. 2008. Playing games for security: An efficient exact algorithm for solving Bayesian Stackelberg games. In Proceedings of the International Joint Conference on Autonomous Agents 8 Multiagent Systems (AAMAS\u201908). IFAAMAS, Columbia, SC, 895--902."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.86.3200"},{"key":"e_1_2_1_48_1","volume-title":"Proceedings of the International Joint Conference on Autonomous Agents 8 Multiagent Systems (AAMAS\u201908)","author":"Pita James","year":"2008","unstructured":"James Pita , Manish Jain , Janusz Marecki , Fernando Ord\u00f3\u00f1ez , Christopher Portway , Milind Tambe , Craig Western , Praveen Paruchuri , and Sarit Kraus . 2008 . Deployed ARMOR protection: The application of a game theoretic model for security at the Los Angeles International Airport . In Proceedings of the International Joint Conference on Autonomous Agents 8 Multiagent Systems (AAMAS\u201908) . IFAAMAS, Columbia, SC, 125--132. James Pita, Manish Jain, Janusz Marecki, Fernando Ord\u00f3\u00f1ez, Christopher Portway, Milind Tambe, Craig Western, Praveen Paruchuri, and Sarit Kraus. 2008. Deployed ARMOR protection: The application of a game theoretic model for security at the Los Angeles International Airport. In Proceedings of the International Joint Conference on Autonomous Agents 8 Multiagent Systems (AAMAS\u201908). IFAAMAS, Columbia, SC, 125--132."},{"key":"e_1_2_1_49_1","volume-title":"Neuer beweis eines satzes \u00fcber permutationen. Arch. Math. Phys. 3. Reihe 27 (01","author":"Pr\u00fcfer H.","year":"1918","unstructured":"H. Pr\u00fcfer . 1918. Neuer beweis eines satzes \u00fcber permutationen. Arch. Math. Phys. 3. Reihe 27 (01 1918 ), 142--144. H. Pr\u00fcfer. 1918. Neuer beweis eines satzes \u00fcber permutationen. Arch. Math. Phys. 3. Reihe 27 (01 1918), 142--144."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.psi.2015.08.001"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2010.35"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/INNOVATIONS.2018.8605942"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1080\/00223980.1954.9712925"},{"key":"e_1_2_1_54_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence (AAAI\u201912)","author":"Shieh Eric Anyung","year":"2012","unstructured":"Eric Anyung Shieh , Bo An , Rong Yang , Milind Tambe , Craig Baldwin , Joseph DiRenzo , Ben Maule , and Garrett Meyer . 2012 . PROTECT: An application of computational game theory for the security of the ports of the United States . In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI\u201912) . The AAAI Press, Palo Alto, CA, 2173--2179. Eric Anyung Shieh, Bo An, Rong Yang, Milind Tambe, Craig Baldwin, Joseph DiRenzo, Ben Maule, and Garrett Meyer. 2012. PROTECT: An application of computational game theory for the security of the ports of the United States. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI\u201912). The AAAI Press, Palo Alto, CA, 2173--2179."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01213906"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11202"},{"key":"e_1_2_1_57_1","volume-title":"The Quantum Theory of Trust: The Secret of Mapping and Managing Human Relationships","author":"Stephenson Karen","unstructured":"Karen Stephenson . 2004. The Quantum Theory of Trust: The Secret of Mapping and Managing Human Relationships . Financial Times Prentice Hall , Upper Saddle River, NJ. Karen Stephenson. 2004. The Quantum Theory of Trust: The Secret of Mapping and Managing Human Relationships. Financial Times Prentice Hall, Upper Saddle River, NJ."},{"key":"e_1_2_1_58_1","volume-title":"Barto","author":"Sutton Richard S.","year":"1998","unstructured":"Richard S. Sutton and Andrew G . Barto . 1998 . Reinforcement Learning : An Introduction. Vol. 1 . The MIT Press , Cambridge, MA. Richard S. Sutton and Andrew G. Barto. 1998. Reinforcement Learning: An Introduction. Vol. 1. The MIT Press, Cambridge, MA."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.11.001"},{"key":"e_1_2_1_60_1","volume-title":"Deployed Systems, Lessons Learned","author":"Tambe Milind","unstructured":"Milind Tambe . 2011. Security and Game Theory: Algorithms , Deployed Systems, Lessons Learned . Cambridge University Press, Cambridge , MA. Milind Tambe. 2011. Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned. Cambridge University Press, Cambridge, MA."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11239"},{"key":"e_1_2_1_62_1","volume-title":"Proceedings of the International Joint Conference on Autonomous Agents 8 Multiagent Systems (AAMAS\u201909)","author":"Tsai Jason","year":"2009","unstructured":"Jason Tsai , Christopher Kiekintveld , Fernando Ordonez , Milind Tambe , and Shyamsunder Rathi . 2009 . IRIS\u2014A tool for strategic security allocation in transportation networks . In Proceedings of the International Joint Conference on Autonomous Agents 8 Multiagent Systems (AAMAS\u201909) . IFAAMAS, Columbia, SC, 37--44. Jason Tsai, Christopher Kiekintveld, Fernando Ordonez, Milind Tambe, and Shyamsunder Rathi. 2009. IRIS\u2014A tool for strategic security allocation in transportation networks. In Proceedings of the International Joint Conference on Autonomous Agents 8 Multiagent Systems (AAMAS\u201909). IFAAMAS, Columbia, SC, 37--44."},{"key":"e_1_2_1_63_1","unstructured":"Eric Vanderburg. 2017. The 6 Stages of an Advanced Ransomware Threat Attack. Carbonite. www.carbonite.com\/blog\/article\/2017\/08\/the-6-stages-of-an-advanced-ransomware-threat-attack\/.  Eric Vanderburg. 2017. The 6 Stages of an Advanced Ransomware Threat Attack. Carbonite. www.carbonite.com\/blog\/article\/2017\/08\/the-6-stages-of-an-advanced-ransomware-threat-attack\/."},{"key":"e_1_2_1_64_1","volume-title":"Marktform und Gleichgewicht","author":"Stackelberg Heinrich Von","unstructured":"Heinrich Von Stackelberg . 1934. Marktform und Gleichgewicht . J. Springer , Berlin . Heinrich Von Stackelberg. 1934. Marktform und Gleichgewicht. J. Springer, Berlin."},{"key":"e_1_2_1_65_1","volume-title":"Strogatz","author":"Watts Duncan J.","year":"1998","unstructured":"Duncan J. Watts and Steven H . Strogatz . 1998 . Collective dynamics of small-world networks. Nature 393, 6684 (1998), 440--442. Duncan J. Watts and Steven H. Strogatz. 1998. Collective dynamics of small-world networks. Nature 393, 6684 (1998), 440--442."},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357605","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357605","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:22Z","timestamp":1750202602000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357605"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,10]]},"references-count":66,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2,29]]}},"alternative-id":["10.1145\/3357605"],"URL":"https:\/\/doi.org\/10.1145\/3357605","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,10]]},"assertion":[{"value":"2019-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-12-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}