{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:57:02Z","timestamp":1725469022514},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540377917"},{"type":"electronic","value":"9783540377931"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11821069_62","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T10:25:12Z","timestamp":1156501512000},"page":"717-728","source":"Crossref","is-referenced-by-count":9,"title":["The Price of Defense"],"prefix":"10.1007","author":[{"given":"Marios","family":"Mavronicolas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loizos","family":"Michael","sequence":"additional","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":[{"key":"62_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/11537311_18","volume-title":"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: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol.\u00a03623, pp. 197\u2013208. Springer, Heidelberg (2005)"},{"key":"62_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1007\/11600930_103","volume-title":"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., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 1023\u20131032. Springer, Heidelberg (2005)"},{"key":"62_CR3","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":"62_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"62_CR5","doi-asserted-by":"crossref","unstructured":"Gelastou, M., Mavronicolas, M., Papadopoulou, V., Philippou, A., Spirakis, P.: The Power of the Defender. In: Proceedings of the 2nd International Workshop on Incentive-Based Computing (2006) (to appear)","DOI":"10.1109\/ICDCSW.2006.107"},{"key":"62_CR6","series-title":"LNCS","first-page":"155","volume-title":"Algorithms - ESA 1995","author":"A.V. Goldberg","year":"1995","unstructured":"Goldberg, A.V., Karzanov, A.V.: Maximum Skew-Symmetric Flows. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 155\u2013170. Springer, Heidelberg (1995)"},{"key":"62_CR7","series-title":"LNCS","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.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"62_CR8","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.\u00a01, pp. 279\u2013286 (2001)","DOI":"10.1109\/DISCEX.2001.932222"},{"key":"62_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/11602613_30","volume-title":"Algorithms and Computation","author":"M. Mavronicolas","year":"2005","unstructured":"Mavronicolas, M., Papadopoulou, V.G., Philippou, A., Spirakis, P.G.: A Network Game with Attacker and Protector Entities. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 288\u2013297. Springer, Heidelberg (2005)"},{"key":"62_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1007\/11600930_98","volume-title":"Internet and Network Economics","author":"M. Mavronicolas","year":"2005","unstructured":"Mavronicolas, M., Papadopoulou, V.G., Philippou, A., Spirakis, P.G.: A Graph-Theoretic Network Security Game. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 969\u2013978. Springer, Heidelberg (2005)"},{"key":"62_CR11","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 National Acanemy of Sciences of the United States of America\u00a036, 48\u201349 (1950)","journal-title":"Proceedings of National Acanemy of Sciences of the United States of America"},{"issue":"2","key":"62_CR12","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J.F. Nash","year":"1951","unstructured":"Nash, J.F.: Non-Cooperative Games. Annals of Mathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"62_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"J. Neumann von","year":"1928","unstructured":"von Neumann, J.: Zur Theorie der Gesellschaftsspiele. Mathematische Annalen\u00a0100, 295\u2013320 (1928)","journal-title":"Mathematische Annalen"},{"issue":"2","key":"62_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The Complexity of Computing the Permanent. Theoretical Computer Science\u00a08(2), 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"},{"key":"62_CR15","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Englewood Cliffs (2001)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11821069_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:30:46Z","timestamp":1619508646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11821069_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377917","9783540377931"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11821069_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}