A graph-theoretic network security game

International Journal of Autonomous and Adaptive Communications Systems

Volumn 1, Issue 4, 2008, Pages 390-410

  Mavronicolas, Marios ^a   Papadopoulou, Vicky G ^a   Philippou, Anna ^a   Spirakis, Paul G ^b,c  

^a UNIVERSITY OF CYPRUS   (Cyprus)

^b UNIVERSITY OF PATRAS   (Greece)

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

Author keywords

Graph theory; Nash equilibria; Network security games

Indexed keywords

COMPUTER VIRUSES; GRAPH THEORY; TREES (MATHEMATICS); VIRUSES;

EXISTENCE PROBLEMS; MULTIPLAYER GAMES; NASH EQUILIBRIA; PERFECT MATCHINGS; PRACTICAL NETWORKS; PRICE OF ANARCHY; PURE NASH EQUILIBRIUM; SECURITY SOFTWARE;

NETWORK SECURITY;

EID: 81855194700     PISSN: 17548632     EISSN: 17548640     Source Type: Journal    
DOI: 10.1504/IJAACS.2008.021488     Document Type: Article

References (14)

1. Aspnes, J., Chang, K. and Yampolskiy, A. (2006) 'Inoculation strategies for victims of viruses and the sum-of-squares partition problem', Journal of Computer and System Sciences, Vol. 72, pp. 1077-1093. (Pubitemid 44163572)
2. Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability: A Guide to Theory of NP-s. New York, NY: W. H./Freeman and Company.
3. Gelastou, M., Mavronicolas, M., Papadopoulou, V. G., Philippou, A. and Spirakis, P. (2006) 'The power of the defender', Paper presented in the CD-ROM Proceedings of the 2nd International Workshop on Incentive-Based Computing, in Conjunction with the 26th IEEE International Conference on Distributed Computing, July.
4. Goldberg, A. V. and Karzanov, A. V. (1995) 'Maximum skew-symmetric flows', Paper presented in the Proceedings of the 3rd Annual European Symposium on Algorithms, Lecture Notes in Computer Science, Vol. 979, pp. 155-170, Springer-Verlag, September.
5. Koutsoupias, E. and Papadimitriou, C. H. (1999) 'Worst-case equilibria', Paper presented in the Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 1563, pp. 404-413, Springer-Verlag, March.
6. Lovász, L. and Plummer, M. D. (1986) Matching Theory. Budapest, Hungary: North-Holland Mathematics Studies, Vol. 121.
7. Mavronicolas, M., Monien, B. and Papadopoulou, V. G. (2008) 'How many attackers can selfish defenders catch?', Paper presented in the CD-ROM Proceedings of the 41st Hawaii International Conference on Systems Science, January.
8. Mavronicolas, M., Papadopoulou, V. G., Persiano, G., Philippou, A. and Spirakis, P. G. (2006a) 'The price of defense and fractional matchings', Paper presented in the Proceedings of the 8th International Conference on Distributed Computing and Networking, Lecture Notes in Computer Science, Vol. 4308, pp. 115-126, Springer-Verlag, December.
9. Mavronicolas, M., Michael, L., Papadopoulou, V. G., Philippou, A. and Spirakis, P. G. (2006b) 'The price of defense', Paper presented in the Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 4162, pp. 717-728, Springer-Verlag, August/September. (Pubitemid 44577958)
10. Mavronicolas, M., Papadopoulou, V. G., Philippou, A. and Spirakis, P. G. (2008) 'A network game with attackers and a defender', Algorithmica, Special Issue with Selected Papers from the 16th Annual International Symposium on Algorithms and Computation, Vol. 51, pp. 315-341. (Pubitemid 351703639)
11. Nash, J. F. (1950) 'Equilibrium points in N-person games', Paper presented in the Proceedings of the National Academy of Sciences of the United States of America, Vol. 36, pp. 48-49.
12. Nash, J. F. (1951) 'Non-cooperative games', Annals of Mathematics, Vol. 54, pp. 286-295.
13. Tutte, W. T. (1954) 'A short proof of the factor theorem for finite graphs', Canadian Journal of Mathematics, Vol. 6, pp. 347-352.
14. West, D. B. (2001) Introduction to Graph Theory, (2nd ed.). Upper Saddle River, NJ: Prentice Hall.