{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:56:10Z","timestamp":1743065770543,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610921"},{"type":"electronic","value":"9789819610938"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1093-8_7","type":"book-chapter","created":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:19:02Z","timestamp":1739999942000},"page":"79-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Resource-Limited Network Security Games with\u00a0General Contagious Attacks"],"prefix":"10.1007","author":[{"given":"Rufan","family":"Bai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenyang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruilong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,20]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1016\/j.jet.2016.09.009","volume":"166","author":"D Acemoglu","year":"2016","unstructured":"Acemoglu, D., Malekian, A., Ozdaglar, A.E.: Network security and contagion. J. Econ. Theory 166, 536\u2013585 (2016)","journal-title":"J. Econ. Theory"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Andreev, K., R\u00e4cke, H.: Balanced graph partitioning. In: SPAA, pp. 120\u2013124. ACM (2004)","DOI":"10.1145\/1007912.1007931"},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1502793.1502794","volume":"56","author":"S Arora","year":"2009","unstructured":"Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning. J. ACM (JACM) 56(2), 1\u201337 (2009)","journal-title":"J. ACM (JACM)"},{"issue":"6","key":"7_CR4","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1016\/j.jcss.2006.02.003","volume":"72","author":"J Aspnes","year":"2006","unstructured":"Aspnes, J., Chang, K.L., Yampolskiy, A.: Inoculation strategies for victims of viruses and the sum-of-squares partition problem. J. Comput. Syst. Sci. 72(6), 1077\u20131093 (2006)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"7_CR5","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/0010-4825(87)90060-6","volume":"17","author":"N Assimakopoulos","year":"1987","unstructured":"Assimakopoulos, N.: A network interdiction model for hospital infection control. Comput. Biol. Med. 17(6), 413\u2013422 (1987)","journal-title":"Comput. Biol. Med."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Draief, M., Goyal, S.: Contagion and observability in security domains. In: Allerton, pp. 1364\u20131371. IEEE (2013)","DOI":"10.1109\/Allerton.2013.6736686"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Bai, R., Lin, H., Yang, X., Wu, X., Li, M., Jia, W.: Defending against contagious attacks on a network with resource reallocation. In: AAAI, pp. 5135\u20135142. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i6.16649"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Bai, R., Lin, H., Yang, X., Wu, X., Li, M., Jia, W.: Mixed strategies for security games with general defending requirements. In: IJCAI, pp. 46\u201352 (2022). https:\/\/www.ijcai.org\/","DOI":"10.24963\/ijcai.2022\/7"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1613\/jair.1.14563","volume":"77","author":"R Bai","year":"2023","unstructured":"Bai, R., Lin, H., Yang, X., Wu, X., Li, M., Jia, W.: Stackelberg security games with contagious attacks on a network: reallocation to the rescue. J. Artif. Intell. Res. 77, 487\u2013515 (2023)","journal-title":"J. Artif. Intell. Res."},{"issue":"7","key":"7_CR10","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1057\/jors.2016.37","volume":"68","author":"A Baldwin","year":"2017","unstructured":"Baldwin, A., Gheyas, I., Ioannidis, C., Pym, D.J., Williams, J.: Contagion in cyber security attacks. J. Oper. Res. Soc. 68(7), 780\u2013791 (2017)","journal-title":"J. Oper. Res. Soc."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Micha, E., Shah, N.: A little charity guarantees fair connected graph partitioning. In: AAAI, pp. 4908\u20134916. AAAI Press (2022)","DOI":"10.1609\/aaai.v36i5.20420"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.jet.2017.05.006","volume":"170","author":"D Cerdeiro","year":"2017","unstructured":"Cerdeiro, D., Dziubinski, M., Goyal, S.: Individual security, contagion, and network design. J. Econ. Theory 170, 182\u2013226 (2017)","journal-title":"J. Econ. Theory"},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"1753","DOI":"10.1007\/s10878-020-00544-w","volume":"44","author":"G Chen","year":"2022","unstructured":"Chen, G., Chen, Y., Chen, Z., Lin, G., Liu, T., Zhang, A.: Approximation algorithms for the maximally balanced connected graph tripartition problem. J. Comb. Optim. 44(3), 1753\u20131773 (2022)","journal-title":"J. Comb. Optim."},{"key":"7_CR14","unstructured":"Durkota, K., Lis\u00fd, V., Bosansk\u00fd, B., Kiekintveld, C.: Optimal network security hardening using attack graph games. In: IJCAI, pp. 526\u2013532. AAAI Press (2015)"},{"issue":"2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/s00453-013-9802-3","volume":"71","author":"AE Feldmann","year":"2015","unstructured":"Feldmann, A.E., Foschini, L.: Balanced partitions of trees and applications. Algorithmica 71(2), 354\u2013376 (2015)","journal-title":"Algorithmica"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Gan, J., An, B., Vorobeychik, Y.: Security games with protection externalities. In: AAAI, pp. 914\u2013920. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9323"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Gan, J., An, B., Vorobeychik, Y., Gauch, B.: Security games on a plane. In: AAAI, pp. 530\u2013536. AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.10614"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Kumar, V.S.A., Rajaraman, R., Sun, Z., Sundaram, R.: Existence theorems and approximation algorithms for generalized network security games. In: ICDCS, pp. 348\u2013357. IEEE Computer Society (2010)","DOI":"10.1109\/ICDCS.2010.70"},{"issue":"6","key":"7_CR19","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"T Leighton","year":"1999","unstructured":"Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM (JACM) 46(6), 787\u2013832 (1999)","journal-title":"J. ACM (JACM)"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Li, M., Tran-Thanh, L., Wu, X.: Defending with shared resources on a network. In: AAAI, pp. 2111\u20132118. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i02.5585"},{"issue":"6","key":"7_CR21","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.1109\/TPDS.2021.3116863","volume":"33","author":"Q Liu","year":"2022","unstructured":"Liu, Q., Xia, T., Cheng, L., van Eijk, M., Ozcelebi, T., Mao, Y.: Deep reinforcement learning for load-balancing aware network control in IoT edge systems. IEEE Trans. Parallel Distrib. Syst. 33(6), 1491\u20131502 (2022)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Mofrad, M.H., Melhem, R., Hammoud, M.: Revolver: vertex-centric graph partitioning using reinforcement learning. In: 2018 IEEE 11th International Conference on Cloud Computing (CLOUD), pp. 818\u2013821. IEEE (2018)","DOI":"10.1109\/CLOUD.2018.00111"},{"key":"7_CR23","unstructured":"Schlenker, A., et al.: Deceiving cyber adversaries: a game theoretic approach. In: AAMAS, pp. 892\u2013900 (2018)"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Tanaka, M., Taura, K., Hanawa, T., Torisawa, K.: Automatic graph partitioning for very large-scale deep learning. In: 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1004\u20131013. IEEE (2021)","DOI":"10.1109\/IPDPS49936.2021.00109"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Tsai, J., Nguyen, T.H., Tambe, M.: Security games for controlling contagion. In: AAAI. AAAI Press (2012)","DOI":"10.1109\/SocialCom.2013.11"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Wang, Y., et al.: Deep reinforcement learning for green security games with real-time information. In: AAAI, pp. 1401\u20131408. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33011401"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Xue, W., An, B., Yeo, C.K.: NSGZero: efficiently learning non-exploitable policy in large-scale network security games with neural monte Carlo tree search. In: AAAI, pp. 4646\u20134653. AAAI Press (2022)","DOI":"10.1609\/aaai.v36i4.20389"},{"key":"7_CR28","unstructured":"Yin, Y., Xu, H., Gan, J., An, B., Jiang, A.X.: Computing optimal mixed strategies for security games with dynamic payoffs. In: IJCAI, pp. 681\u2013688. AAAI Press (2015)"},{"key":"7_CR29","unstructured":"Yuan, B., et al.: Decentralized training of foundation models in heterogeneous environments. In: NeurIPS (2022)"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, Y., An, B., Tran-Thanh, L., Wang, Z., Gan, J., Jennings, N.R.: Optimal escape interdiction on transportation networks. In: IJCAI, pp. 3936\u20133944 (2017). https:\/\/www.ijcai.org\/","DOI":"10.24963\/ijcai.2017\/550"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1093-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:19:18Z","timestamp":1739999958000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1093-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610921","9789819610938"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1093-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}