Security scheduling for real-world networks
暂无分享,去创建一个
[1] Vincent Conitzer,et al. A double oracle algorithm for zero-sum security games on graphs , 2011, AAMAS.
[2] Rong Yang,et al. Designing better strategies against human adversaries in network security games , 2012, AAMAS.
[3] Vincent Conitzer,et al. Multi-Step Multi-Sensor Hider-Seeker Games , 2009, IJCAI.
[4] S. Alpern. Infiltration games on arbitrary graphs , 1992 .
[5] David Eppstein,et al. Studying (non-planar) road networks through an algorithmic lens , 2008, GIS '08.
[6] Patrick Weber,et al. OpenStreetMap: User-Generated Street Maps , 2008, IEEE Pervasive Computing.
[7] Steven Okamoto,et al. Solving non-zero sum multiagent network flow security games with attack costs , 2012, AAMAS.
[8] Branislav Bosanský,et al. Game-theoretic resource allocation for malicious packet detection in computer networks , 2012, AAMAS.
[9] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[10] Avrim Blum,et al. Planning in the Presence of Cost Functions Controlled by an Adversary , 2003, ICML.
[11] Bo An,et al. PROTECT: a deployed game theoretic system to protect the ports of the United States , 2012, AAMAS.
[12] Milind Tambe,et al. Urban security: game-theoretic resource allocation in networked physical domains , 2010, AAAI 2010.
[13] Alan Washburn,et al. Two-Person Zero-Sum Games for Network Interdiction , 1995, Oper. Res..
[14] Milind Tambe,et al. The Deployment-to-Saturation Ratio in Security Games , 2012, AAAI.
[15] P. Hudson. Search Games , 1982 .
[16] Vincent Conitzer,et al. Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness , 2010, AAMAS.