{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T10:53:55Z","timestamp":1762340035571},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309000"},{"type":"electronic","value":"9783540322931"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11600930_98","type":"book-chapter","created":{"date-parts":[[2005,11,24]],"date-time":"2005-11-24T14:48:12Z","timestamp":1132843692000},"page":"969-978","source":"Crossref","is-referenced-by-count":19,"title":["A Graph-Theoretic Network Security Game"],"prefix":"10.1007","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","reference":[{"issue":"1","key":"98_CR1","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.: A Graph-Theoretic Game and its Application to the k-Server Problem. SIAM Journal on Computing\u00a024(1), 78\u2013100 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"98_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 (2005)"},{"key":"98_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-Case Equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"98_CR4","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Papadopoulou, V., Philippou, A., Spirakis, P.: A Network Game with Attacker and Protector Entities. In: The Proceedings of the 16th Annual International Symposium on Algorithms and Computation (2005)","DOI":"10.1007\/11602613_30"},{"key":"98_CR5","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Papadopoulou, V., Philippou, A., Spirakis, P.: A Graph-Theoretic Network Security Game. TR-09-05, University of Cyprus (2005)","DOI":"10.1007\/11600930_98"},{"key":"98_CR6","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An $O( \\sqrt{V}E)$ Algorithm for Finding Maximum Matching in General Graphs. In: Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, pp. 17\u201327 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"98_CR7","doi-asserted-by":"publisher","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. Proceedings of the National Acanemy of Sciences of the United States of America\u00a036, 48\u201349 (1950)","journal-title":"Proceedings of the National Acanemy of Sciences of the United States of America"},{"issue":"2","key":"98_CR8","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J.F. Nash","year":"1951","unstructured":"Nash, J.F.: Noncooperative Games. Annals of Mathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"98_CR9","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)"},{"key":"98_CR10","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, Games, and the Internet. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"98_CR11","doi-asserted-by":"publisher","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","volume":"6","author":"W.T. Tutte","year":"1954","unstructured":"Tutte, W.T.: A Short Proof of the Factor Theorem for Finite Graphs. Canadian Journal of Mathematics\u00a06, 347\u2013352 (1954)","journal-title":"Canadian Journal of Mathematics"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11600930_98.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:01:53Z","timestamp":1619506913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11600930_98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309000","9783540322931"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11600930_98","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}