Approximation Algorithm for Security Games with Costly Resources
暂无分享,去创建一个
Vincent Conitzer | Kamesh Munagala | Sayan Bhattacharya | Sayan Bhattacharya | Kamesh Munagala | Vincent Conitzer
[1] Milind Tambe,et al. Security and Game Theory: IRIS – A Tool for Strategic Security Allocation in Transportation Networks , 2011, AAMAS 2011.
[2] Gregory Dobson,et al. Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data , 1982, Math. Oper. Res..
[3] Sarit Kraus,et al. Deployed ARMOR protection: the application of a game theoretic model for security at the Los Angeles International Airport , 2008, AAMAS.
[4] Manish Jain,et al. Computing optimal randomized resource allocations for massive security games , 2009, AAMAS.
[5] Sarit Kraus,et al. Using Game Theory for Los Angeles Airport Security , 2009, AI Mag..
[6] Paul W. Goldberg,et al. The complexity of computing a Nash equilibrium , 2006, STOC '06.
[7] Bo An,et al. GUARDS and PROTECT: next generation applications of security games , 2011, SECO.
[8] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[9] Kousha Etessami,et al. On the Complexity of Nash Equilibria and Other Fixed Points , 2010, SIAM J. Comput..
[10] Vincent Conitzer,et al. Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games , 2010, AAAI.
[11] Xiaotie Deng,et al. Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[12] Dorit S. Hochba,et al. Approximation Algorithms for NP-Hard Problems , 1997, SIGA.