{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:48:33Z","timestamp":1760597313871},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,30]],"date-time":"2007-10-30T00:00:00Z","timestamp":1193702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s00453-007-9109-3","type":"journal-article","created":{"date-parts":[[2007,10,29]],"date-time":"2007-10-29T11:09:25Z","timestamp":1193656165000},"page":"315-341","source":"Crossref","is-referenced-by-count":17,"title":["A Network Game with Attackers and a Defender"],"prefix":"10.1007","volume":"51","author":[{"given":"Marios","family":"Mavronicolas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vicky","family":"Papadopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Philippou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,30]]},"reference":[{"issue":"1","key":"9109_CR1","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1137\/S0097539792224474","volume":"24","author":"N. Alon","year":"1995","unstructured":"Alon, N., Karp, R.M., Peleg, D., West, D.: 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."},{"key":"9109_CR2","unstructured":"Aspnes, J., Chang, K., Yampolskiy, A.: Inoculation strategies for victims of viruses and the sum-of-squares problem. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 43\u201352 (January 2005)"},{"key":"9109_CR3","series-title":"Cambridge Tracts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511984068","volume-title":"Bipartite Graphs and Their Applications","author":"A.S. Asratian","year":"1998","unstructured":"Asratian, A.S., Denley, T.M.J., H\u00e4ggkvist, R.: Bipartite Graphs and Their Applications. Cambridge Tracts in Mathematics, vol.\u00a0131. Cambridge University Press, Cambridge (1998)"},{"key":"9109_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/11537311_18","volume-title":"Proceedings of the 15th International Symposium on Fundamentals of Computation Theory","author":"V. Bonifaci","year":"2005","unstructured":"Bonifaci, V., Di Iorio, U., Laura, L.: On the complexity of uniformly mixed Nash equilibria and related regular subgraph problems. In: Liskiewicz, M. (ed.) Proceedings of the 15th International Symposium on Fundamentals of Computation Theory. Lecture Notes in Computer Science, vol.\u00a03623, pp. 197\u2013208. Springer, New York (2005)"},{"key":"9109_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1007\/11600930_103","volume-title":"Proceedings of the First International Workshop on Internet and Network Economics","author":"V. Bonifaci","year":"2005","unstructured":"Bonifaci, V., Di Iorio, U., Laura, L.: New results on the complexity of uniformly mixed Nash equilibria. In: Deng, X. (ed.) Proceedings of the First International Workshop on Internet and Network Economics. Lecture Notes in Computer Science, vol.\u00a03828, pp. 1023\u20131032. Springer, New York (2005)"},{"key":"9109_CR6","volume-title":"Firewalls and Internet Security","author":"E.R. Cheswick","year":"1994","unstructured":"Cheswick, E.R., Bellovin, S.M.: Firewalls and Internet Security. Addison-Wesley, Reading (1994)"},{"key":"9109_CR7","first-page":"16","volume":"38","author":"E. Egerv\u00e1ry","year":"1931","unstructured":"Egerv\u00e1ry, E.: On combinatorial properties of matrices. Mat. Fiz. Lapok 38, 16\u201328 (1931) (in Hungarian with German summary)","journal-title":"Mat. Fiz. Lapok"},{"issue":"2","key":"9109_CR8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1006\/jcss.1995.1065","volume":"51","author":"T. Feder","year":"1995","unstructured":"Feder, T., Motwani, R.: Clique compressions, graph partitions and speeding-up algorithms. J. Comput. Syst. Sci. 51(2), 261\u2013272 (1995)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9109_CR9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/333979.333980","volume":"47","author":"M. Franklin","year":"2000","unstructured":"Franklin, M., Alto, P., 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":"9109_CR10","unstructured":"Frobenius, G.: \u00dcber Zerlegbare Determinanten. In: Sitzungsber der K\u00f6niglich, vol. XVIII, pp. 274\u2013277. Preussischen Akademie der Wissenschaften (1917)"},{"key":"9109_CR11","doi-asserted-by":"crossref","unstructured":"Gelastou, M., Mavronicolas, M., Papadopoulou, V., Philippou, A., Spirakis, P.: The power of the defender. In: CD-ROM Proceedings of the 2nd International Workshop on Incentive-Based Computing, in conjunction with the 26th IEEE International Conference on Distributed Computing, July 2006","DOI":"10.1109\/ICDCSW.2006.107"},{"key":"9109_CR12","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"Hall, P.: On representation of subsets. J. Lond. Math. Soc. Ser. 2 10, 26\u201330 (1935)","journal-title":"J. Lond. Math. Soc. Ser. 2"},{"key":"9109_CR13","volume-title":"Advances in Neural Information Processing Systems","author":"M. Kearns","year":"2004","unstructured":"Kearns, M., Ortiz, L.: Algorithms for interdependent security games. In: Thrun, S., Saul, L. (eds.) Advances in Neural Information Processing Systems, vol.\u00a016. MIT Press, Cambridge (2004)"},{"key":"9109_CR14","first-page":"116","volume":"38","author":"D. K\u00f6nig","year":"1931","unstructured":"K\u00f6nig, D.: Graphen und Matrizen. Mat. Fiz. Lapok 38, 116\u2013119 (1931)","journal-title":"Mat. Fiz. Lapok"},{"key":"9109_CR15","unstructured":"K\u00f6nig, D.: Theorie der Endlichen und Unendlichen Graphen. Akademische Verlagsgesellschaft (1936)"},{"key":"9109_CR16","doi-asserted-by":"crossref","unstructured":"Markham, T., Payne, C.: Security at the network edge: a distributed firewall architecture. In: Proceedings of the 2nd DARPA Information Survivability Conference and Exposition, vol. 1, pp. 279\u2013286 (June 2001)","DOI":"10.1109\/DISCEX.2001.932222"},{"key":"9109_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1007\/11600930_98","volume-title":"Proceedings of the 1st International Workshop on Internet and Network Economics","author":"M. Mavronicolas","year":"2005","unstructured":"Mavronicolas, M., Papadopoulou, V., Philippou, A., Spirakis, P.: A graph-theoretic network security game. In: Deng, X. (ed.) Proceedings of the 1st International Workshop on Internet and Network Economics. Lecture Notes in Computer Science, vol.\u00a03828, pp. 969\u2013978. Springer, New York (2005)"},{"key":"9109_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/11821069_62","volume-title":"Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science","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. (ed.) Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol.\u00a04162, pp. 717\u2013728. Springer, New York (2006)"},{"key":"9109_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/11947950_13","volume-title":"Proceedings of the 8th International Conference on Distributed Computing and Networking","author":"M. Mavronicolas","year":"2006","unstructured":"Mavronicolas, M., Papadopoulou, V., Persiano, G., Philippou, A., Spirakis, P.: The price of defense and fractional matchings. In: Chaudhuri, R.S., Das, S.R., Paul, H.S., Tirthapura, S. (eds.) Proceedings of the 8th International Conference on Distributed Computing and Networking. Lecture Notes in Computer Science, vol.\u00a04308, pp. 115\u2013126. Springer, New York (2006)"},{"key":"9109_CR20","unstructured":"Mavronicolas, M., Spirakis, P.: Algorithmic Game Theory. Springer, New York (2007, to appear)"},{"key":"9109_CR21","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J.F. Nash","year":"1950","unstructured":"Nash, J.F.: Equilibrium points in N-person games. Proc. Natl. Acad. Sci. USA 36, 48\u201349 (1950)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"2","key":"9109_CR22","doi-asserted-by":"crossref","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J.F. Nash","year":"1951","unstructured":"Nash, J.F.: Non-cooperative games. Ann. Math. 54(2), 286\u2013295 (1951)","journal-title":"Ann. Math."},{"key":"9109_CR23","volume-title":"A Course in Game Theory","author":"M. Osborne","year":"1994","unstructured":"Osborne, M., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)"},{"issue":"6","key":"9109_CR24","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1145\/63526.63527","volume":"32","author":"E.H. 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":"9109_CR25","volume-title":"Cryptography and Network Security: Principles and Practice, 3rd edn","author":"W. Stallings","year":"2003","unstructured":"Stallings, W.: Cryptography and Network Security: Principles and Practice, 3rd edn. Prentice-Hall, Englewood Cliffs (2003)"},{"key":"9109_CR26","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"J. Neumann von","year":"1928","unstructured":"von Neumann, J.: Zur Theorie der Gesellschaftsspiele. Math. Ann. 100, 295\u2013320 (1928)","journal-title":"Math. Ann."},{"key":"9109_CR27","volume-title":"Introduction to Graph Theory, 2nd edn","author":"D.B. West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2001)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9109-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9109-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9109-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:00Z","timestamp":1559123100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9109-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,30]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["9109"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9109-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,30]]}}}