Game-theoretic resource allocation for malicious packet detection in computer networks

11th International Conference on Autonomous Agents and Multiagent Systems 2012, AAMAS 2012: Innovative Applications Track

Volumn 2, Issue , 2012, Pages 840-847

  Vaněd, Ondřej ^a   Yin, Zhengyu ^b   Jain, Manish ^b   Bošanský, Branislav ^a   Tambe, Milind ^b   Pěchouček, Michal ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

^b University of Southern California   (United States)

Author keywords

Approximation algorithm; Computer networks; Game theory; Security; Submodularity

Indexed keywords

APPROXIMATION ALGORITHMS; AUTONOMOUS AGENTS; COMPUTER NETWORKS; COMPUTER SCIENCE; MULTI AGENT SYSTEMS; POLYNOMIAL APPROXIMATION; RESOURCE ALLOCATION;

MATHEMATICAL PROGRAM; MULTIPLE COMPUTERS; MULTIPLE RESOURCES; OPTIMAL RESOURCE ALLOCATION; POLYNOMIAL-TIME ALGORITHMS; SECURITY; SUBMODULARITY; UTILITY FUNCTIONS;

GAME THEORY;

EID: 84899445988     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. T. Alpcan. Network Security: A Decision and Game-Theoretic Approach. Cambridge University Press, 2010.
2. L. Chen and J. Leneutre. A game theoretical framework on intrusion detection in heterogeneous networks. IEEE Transactions on Information Forensics and Security, 4(2): 165-178, 2009.
3. V. Conitzer and T. Sandholm. Computing the optimal strategy to commit to. In Proceedings of the 7th ACM conference on Electronic commerce, pages 82-90. ACM, 2006.
4. J. Czyzyk, M. Mesnier, and J. Moré. The NEOS server. Computational Science & Engineering, IEEE, 5(3):68-75, 1998.
5. S. Dughmi. Submodular Functions: Extensions, Distributions, and Algorithms. A Survey. CoRR, 2009.
6. Y. Freund and R. Schapire. Adaptive game playing using multiplicative weights. Games and Economic Behavior, 29(1-2):79-103, 1999.
7. E. Halvorson, V. Conitzer, and R. Parr. Multi-step Multi-sensor Hider-Seeker Games. Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI), 2003.
8. L. Heberlein and M. Bishop. Attack class: Address spoofing. In Proceedings of the 19th National Information Systems Security Conference, pages 371-377, 1996.
9. M. Jain, D. Korzhyk, O. Vaněk, V. Conitzer, M. Pěchouček, and M. Tambe. A double oracle algorithm for zero-sum security games on graphs. In Proceedings of the Tenth International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), Taipei, Taiwan, 2011.
10. M. Jain, J. Tsai, J. Pita, C. Kiekintveld, S. Rathi, M. Tambe, and F. Ordóñez. Software Assistants for Randomized Patrol Planning for the LAX Airport Police and the Federal Air Marshals Service. Interfaces, 40:267-290, 2010.
11. M. Kodialam and T. Lakshman. Detecting network intrusions via sampling: a game theoretic approach. In Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. (INFOCOM), Volume 3, pages 1880-1889. IEEE, 2003.
12. D. Korzhyk, V. Conitzer, and R. Parr. Security games with multiple attacker resources. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 2011.
13. A. Krause and C. Guestrin. Near-optimal observation selection using submodular functions. In Proceedings of the National Conference on Artificial Intelligence (AAAI), 2007.
14. A. Krause, A. Roper, and D. Golovin. Randomized sensing in adversarial environments. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI), pages 2133-2139, 2011.
15. M. Manshaei, Q. Zhu, T. Alpcan, T. Basar, and J. Hubaux. Game theory meets network security and privacy. EPFL, Lausanne, Tech. Rep, 2010.
16. G. Nemhauser and L. Wolsey. Maximizing submodular set functions: formulations and analysis of algorithms. Studies on Graphs and Discrete Programming, pages 279-301, 1981.
17. H. Otrok, M. Mehrandish, C. Assi, M. Debbabi, and P. Bhattacharya. Game theoretic models for detecting network intrusions. Computer Communications, 31(10):1934-1944, 2008.
18. P. Paruchuri, J. Pearce, J. Marecki, M. Tambe, F. Ordóñez, and S. Kraus. Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games. In Proceedings of the 7th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 895-902, 2008.
19. V. Paxson. Bro: A system for detecting network intruders in real-time. Computer networks, 31(23-24):2435-2463, 1999.
20. J. Pita, C. Kiekintveld, M. Tambe, E. Steigerwald, and S. Cullen. GUARDS - Game Theoretic Security Allocation on a National Scale. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2011.
21. L. Schrage and I. LINDO Systems. Optimization modeling with lingo. 1999.
22. J. Vondrak. Optimal approximation for the submodular welfare problem in the value oracle model. In Proceedings of the 40th annual ACM symposium on Theory of computing, STOC '08, pages 67-74, 2008.