{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T16:30:57Z","timestamp":1778344257018,"version":"3.51.4"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319666990","type":"print"},{"value":"9783319667003","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66700-3_16","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T12:38:47Z","timestamp":1503059927000},"page":"199-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Best Response Computation for\u00a0Strategic Network Formation Under Attack"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Friedrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Ihde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Ke\u00dfler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Lenzner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Neubert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Schumann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,19]]},"reference":[{"issue":"6","key":"16_CR1","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., 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":"5","key":"16_CR2","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1111\/1468-0262.00155","volume":"68","author":"V Bala","year":"2000","unstructured":"Bala, V., Goyal, S.: A noncooperative model of network formation. Econometrica 68(5), 1181\u20131229 (2000)","journal-title":"Econometrica"},{"issue":"3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s100580000019","volume":"5","author":"V Bala","year":"2000","unstructured":"Bala, V., Goyal, S.: A strategic analysis of network reliability. Rev. Econ. Des. 5(3), 205\u2013228 (2000). doi:10.1007\/s100580000019. ISSN 1434-4750","journal-title":"Rev. Econ. Des."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Leucci, S., Proietti, G.: Locality-based network creation games. In: SPAA 2014, pp. 277\u2013286 (2014)","DOI":"10.1145\/2612669.2612680"},{"issue":"3","key":"16_CR5","first-page":"16:1","volume":"3","author":"D Bil\u00f2","year":"2015","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Proietti, G.: Bounded-distance network creation games. ACM TEAC 3(3), 16:1\u201316:20 (2015)","journal-title":"ACM TEAC"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-662-53354-3_12","volume-title":"Algorithmic Game Theory","author":"A Chauhan","year":"2016","unstructured":"Chauhan, A., Lenzner, P., Melnichenko, A., M\u00fcnn, M.: On selfish creation of robust networks. In: Gairing, M., Savani, R. (eds.) SAGT 2016. LNCS, vol. 9928, pp. 141\u2013152. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-53354-3_12"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Chen, P.-A., David, M., Kempe, D.: Better vaccination strategies for better people. In: EC 2010, pp. 179\u2013188. ACM (2010)","DOI":"10.1145\/1807342.1807370"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-662-48054-0_21","volume-title":"Mathematical Foundations of Computer Science 2015","author":"Andreas Cord-Landwehr","year":"2015","unstructured":"Cord-Landwehr, A., Lenzner, P.: Network creation games: think global - act local. In: MFCS 2015, pp. 248\u2013260 (2015)"},{"key":"16_CR9","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Heidelberg (2013)"},{"issue":"4","key":"16_CR10","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/2701615","volume":"11","author":"S Ehsani","year":"2015","unstructured":"Ehsani, S., Fadaee, S.S., Fazli, M., Mehrabian, A., Sadeghabad, S.S., Safari, M.A., Saghafian, M.: A bounded budget network creation game. ACM Trans. Algorithms 11(4), 34 (2015)","journal-title":"ACM Trans. Algorithms"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E.N., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: PODC 2003, pp. 347\u2013351 (2003)","DOI":"10.1145\/872035.872088"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Friedrich, T., Ihde, S., Ke\u00dfler, C., Lenzner, P., Neubert, S., Schumann, D.: Efficient best-response computation for strategic network formation under attack. CoRR, abs\/1610.01861 (2016)","DOI":"10.1007\/978-3-319-66700-3_16"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Goyal, S., Jabbari, S., Kearns, M., Khanna, S., Morgenstern, J.: Strategic Network Formation with Attack and Immunization. arXiv preprint arXiv:1511.05196 (2015)","DOI":"10.1007\/978-3-662-54110-4_30"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-662-54110-4_30","volume-title":"Web and Internet Economics","author":"S Goyal","year":"2016","unstructured":"Goyal, S., Jabbari, S., Kearns, M., Khanna, S., Morgenstern, J.: Strategic network formation with attack and immunization. In: Cai, Y., Vetta, A. (eds.) WINE 2016. LNCS, vol. 10123, pp. 429\u2013443. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-54110-4_30"},{"issue":"1","key":"16_CR15","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jeth.1996.0108","volume":"71","author":"MO Jackson","year":"1996","unstructured":"Jackson, M.O., Wolinsky, A.: A strategic model of social and economic networks. J. Econ. Theory 71(1), 44\u201374 (1996)","journal-title":"J. Econ. Theory"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Kawald, B., Lenzner, P.: On dynamics in selfish network creation. In: SPAA 2013, pp. 83\u201392. ACM (2013)","DOI":"10.1145\/2486159.2486185"},{"issue":"3","key":"16_CR17","doi-asserted-by":"publisher","first-page":"302","DOI":"10.3390\/g2030302","volume":"2","author":"L Kliemann","year":"2011","unstructured":"Kliemann, L.: The price of anarchy for network formation in an adversary model. Games 2(3), 302\u2013332 (2011)","journal-title":"Games"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Kumar, V.A., Rajaraman, R., Sun, Z., Sundaram, R.: Existence theorems and approximation algorithms for generalized network security games. In: ICDCS 2010, pp. 348\u2013357. IEEE (2010)","DOI":"10.1109\/ICDCS.2010.70"},{"key":"16_CR19","first-page":"142","volume-title":"Lecture Notes in Computer Science","author":"Pascal Lenzner","year":"2012","unstructured":"Lenzner, P.: Greedy selfish network creation. In: WINE 2012, pp. 142\u2013155 (2012)"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Meirom, E.A., Mannor, S., Orda, A.: Formation games of reliable networks. In: INFOCOM 2015, pp. 1760\u20131768 (2015)","DOI":"10.1109\/INFOCOM.2015.7218557"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-642-16170-4_24","volume-title":"Algorithmic Game Theory","author":"M Mihal\u00e1k","year":"2010","unstructured":"Mihal\u00e1k, M., Schlegel, J.C.: The price of anarchy in network creation games is (mostly) constant. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 276\u2013287. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-16170-4_24"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the internet. In: STOC 2001, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Saha, S., Adiga, A., Vullikanti, A.K.S.: Equilibria in epidemic containment games. In: AAAI, pp. 777\u2013783 (2014)","DOI":"10.1609\/aaai.v28i1.8819"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66700-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:26:54Z","timestamp":1709828814000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66700-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319666990","9783319667003"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66700-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"L'Aquila","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.gssi.infn.it\/sagt2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}