{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:28:24Z","timestamp":1743078504764,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030304720"},{"type":"electronic","value":"9783030304737"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-30473-7_15","type":"book-chapter","created":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T23:02:36Z","timestamp":1568588556000},"page":"216-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Connected Subgraph Defense Games"],"prefix":"10.1007","author":[{"given":"Eleni C.","family":"Akrida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Argyrios","family":"Deligkas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Themistoklis","family":"Melissourgos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,16]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-030-30473-7_15","volume-title":"Algorithmic Game Theory","author":"Eleni C. Akrida","year":"2019","unstructured":"Akrida, E.C., Deligkas, A., Melissourgos, T., Spirakis, P.G.: Connected subgraph defense games. CoRR abs\/1906.02774 (2019). http:\/\/arxiv.org\/abs\/1906.02774"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1137\/S0097539792224474","volume":"24","author":"N Alon","year":"1995","unstructured":"Alon, N., Karp, R.M., Peleg, D., West, D.B.: A graph-theoretic game and its application to the k-server problem. SIAM J. Comput. 24(1), 78\u2013100 (1995)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1978721.1978729","volume":"10","author":"B An","year":"2011","unstructured":"An, B., Pita, J., Shieh, E., Tambe, M., Kiekintveld, C., Marecki, J.: Guards and protect: Next generation applications of security games. ACM SIGecom Exchanges 10(1), 31\u201334 (2011)","journal-title":"ACM SIGecom Exchanges"},{"issue":"6","key":"15_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."},{"key":"15_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals Simulations and Advanced Topics","author":"H Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals Simulations and Advanced Topics. Wiley, Hoboken (2004)"},{"key":"15_CR6","volume-title":"Firewalls and Internet Security: Repelling the Wily Hacker","author":"WR Cheswick","year":"2003","unstructured":"Cheswick, W.R., Bellovin, S.M., Rubin, A.D.: Firewalls and Internet Security: Repelling the Wily Hacker, 2nd edn. Addison-Wesley Longman Publishing Co. Inc, Boston (2003)","edition":"2"},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/333979.333980","volume":"47","author":"MK Franklin","year":"2000","unstructured":"Franklin, M.K., Galil, Z., Yung, M.: Eavesdropping games: a graph-theoretic approach to privacy in distributed systems. J. ACM 47(2), 225\u2013243 (2000)","journal-title":"J. ACM"},{"key":"15_CR8","unstructured":"Jain, M., Conitzer, V., Tambe, M.: Security scheduling for real-world networks. In: Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems, pp. 215\u2013222. International Foundation for Autonomous Agents and Multiagent Systems (2013)"},{"key":"15_CR9","unstructured":"Kearns, M.J., Ortiz, L.E.: Algorithms for interdependent security games. In: Advances in Neural Information Processing Systems 16 [Neural Information Processing Systems, NIPS], pp. 561\u2013568 (2003)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Letchford, J., Conitzer, V.: Solving security games on graphs via marginal probabilities. In: Twenty-Seventh AAAI Conference on Artificial Intelligence (2013)","DOI":"10.1609\/aaai.v27i1.8688"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/11821069_62","volume-title":"Mathematical Foundations of Computer Science 2006","author":"M Mavronicolas","year":"2006","unstructured":"Mavronicolas, M., Michael, L., Papadopoulou, V., Philippou, A., Spirakis, P.: The price of defense. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 717\u2013728. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11821069_62"},{"issue":"3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s00453-007-9109-3","volume":"51","author":"M Mavronicolas","year":"2008","unstructured":"Mavronicolas, M., Papadopoulou, V., Philippou, A., Spirakis, P.G.: A network game with attackers and a defender. Algorithmica 51(3), 315\u2013341 (2008)","journal-title":"Algorithmica"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Papadopoulou, V.G., Persiano, G., Philippou, A., Spirakis, P.G.: The price of defense and fractional matchings. In: 8th International Conference Distributed Computing and Networking, ICDCN, pp. 115\u2013126 (2006)","DOI":"10.1007\/11947950_13"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Papadopoulou, V.G., Philippou, A., Spirakis, P.G.: A graph-theoretic network security game. In: Internet and Network Economics, First International Workshop, WINE, pp. 969\u2013978 (2005)","DOI":"10.1007\/11600930_98"},{"issue":"1","key":"15_CR15","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"JF Nash","year":"1950","unstructured":"Nash, J.F.: Equilibrium points in n-person games. Proc. Nat. Acad. Sci. U.S.A. 36(1), 48\u201349 (1950)","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"issue":"2","key":"15_CR16","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 54(2), 286\u2013295 (1951)","journal-title":"Ann. Math."},{"issue":"6","key":"15_CR17","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1145\/63526.63527","volume":"32","author":"EH Spafford","year":"1989","unstructured":"Spafford, E.H.: The internet worm: crisis and aftermath. Commun. ACM 32(6), 678\u2013687 (1989)","journal-title":"Commun. ACM"},{"key":"15_CR18","unstructured":"Stallings, W.: Cryptography and network security - principles and practice, 3 edn. Prentice Hall, Upper Saddle River (2003)"},{"key":"15_CR19","unstructured":"Van\u011bk, O., Yin, Z., Jain, M., Bo\u0161ansk\u1ef3, B., Tambe, M., P\u011bchou\u010dek, M.: Game-theoretic resource allocation for malicious packet detection in computer networks. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems-Volume 2, pp. 905\u2013912. International Foundation for Autonomous Agents and Multiagent Systems (2012)"},{"key":"15_CR20","doi-asserted-by":"publisher","unstructured":"Xu, H.: The mysteries of security games: equilibrium computation becomes combinatorial algorithm design. In: Proceedings of the 2016 ACM Conference on Economics and Computation, EC 2016, pp. 497\u2013514. ACM, New York (2016). https:\/\/doi.org\/10.1145\/2940716.2940796, http:\/\/doi.acm.org\/10.1145\/2940716.2940796","DOI":"10.1145\/2940716.2940796"}],"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-030-30473-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:34:15Z","timestamp":1709811255000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30473-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030304720","9783030304737"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30473-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 September 2019","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":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/corelab.ntua.gr\/sagt2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}