The price of defense

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4162 LNCS, Issue , 2006, Pages 717-728

  Mavronicolas, Marios ^a   Michael, Loizos ^b   Papadopoulou, Vicky ^a   Philippou, Anna ^a   Spirakis, Paul ^c,d  

^a UNIVERSITY OF CYPRUS   (Cyprus)

^b HARVARD UNIVERSITY   (United States)

^c University of Patras and Computer Technology Institute   (Greece)

^d UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; GAME THEORY; PATTERN MATCHING; POLYNOMIALS; PROBABILITY;

NASH EQUILIBRIA; PERFECT MATCHING; POLYNOMIAL TIME;

GRAPH THEORY;

EID: 33750053579     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11821069_62     Document Type: Conference Paper

References (15)

1. V. Bonifaci, U. Di Iorio and L. Laura, "On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems", Proceedings of the 15th International Symposium on Fundamentals of Computation Theory, pp. 197-208, Vol. 3623, LNCS, 2005.
2. V. Bonifaci, U. Di Iorio and L. Laura, "New Results on the Complexity of Uniformly Mixed Nash Equilibria", Proceedings of the First International Workshop on Internet and Network Economics, pp. 1023-1032, Vol. 3828, LNCS, 2005.
3. E. R. Cheswick and S. M. Bellovin, Firewalls and Internet Security, Addison-Wesley, 1994.
4. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., 1979.
5. M. Gelastou, M. Mavronicolas, V. Papadopoulou, A. Philippou and P. Spirakis, "The Power of the Defender", Proceedings of the 2nd International Workshop on Incentive-Based Computing, 2006, to appear.
6. A. V. Goldberg and A. V. Karzanov, "Maximum Skew-Symmetric Flows", Proceedings of the 3rd Annual European Symposium on Algorithms, pp. 155-170, Vol. 979, LNCS, 1995.
7. E. Koutsoupias and C. H. Papadimitriou, "Worst-case Equilibria", Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, pp. 404-413, Vol. 1563, LNCS, 1999.
8. T. Markham and C. Payne, "Security at the Network Edge: A Distributed Firewall Architecture", Proceedings of the 2nd DARPA Information Survivability Conference and Exposition, Vol. 1, pp. 279-286, 2001.
9. M. Mavronicolas, V. G. Papadopoulou, A. Philippou and P. G. Spirakis. "A Network Game with Attacker and Protector Entities", Proceedings of the 16th Annual International Symposium on Algorithms and Computation, pp. 288-297, Vol. 3827, LNCS, 2005.
10. M. Mavronicolas, V. G. Papadopoulou, A. Philippou and P. G. Spirakis, "A Graph-Theoretic Network Security Game", Proceedings of the First International Workshop on Internet and Network Economics, pp. 969-978, Vol. 3828, LNCS, 2005.
11. J. F. Nash, "Equilibrium Points in N-Person Games", Proceedings of National Acanemy of Sciences of the United States of America, pp. 48-49, Vol. 36, 1950.
12. J. F. Nash, "Non-Cooperative Games", Annals of Mathematics, Vol. 54, No. 2, pp. 286-295, 1951.
13. J. von Neumann, "Zur Theorie der Gesellschaftsspiele", Mathematische Annalen, Vol. 100, pp. 295-320, 1928.
14. L. G. Valiant, "The Complexity of Computing the Permanent", Theoretical Computer Science, Vol. 8, No. 2, pp. 189-201, 1979.
15. D. B. West, Introduction to Graph Theory, Prentice Hall, Second edition, 2001.