Solving non-zero sum multiagent network flow security games with attack costs
暂无分享,去创建一个
[1] Nicola Basilico,et al. Leader-follower strategies for robotic patrolling in environments with arbitrary topologies , 2009, AAMAS.
[2] Sarit Kraus,et al. Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games , 2008, AAMAS.
[3] Vincent Conitzer,et al. Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness , 2010, AAMAS 2010.
[4] Paul G. Spirakis,et al. A Network Game with Attackers and a Defender , 2008, Algorithmica.
[5] Vincent Conitzer,et al. A double oracle algorithm for zero-sum security games on graphs , 2011, AAMAS.
[6] B. Stengel,et al. Leadership with commitment to mixed strategies , 2004 .
[7] Manish Jain,et al. Computing optimal randomized resource allocations for massive security games , 2009, AAMAS 2009.
[8] Paul G. Spirakis,et al. Weighted random sampling with a reservoir , 2006, Inf. Process. Lett..
[9] R. Kevin Wood,et al. Shortest‐path network interdiction , 2002, Networks.
[10] Mudhakar Srivatsa,et al. Multiagent Communication Security in Adversarial Settings , 2011, 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology.
[11] Milind Tambe,et al. Urban security: game-theoretic resource allocation in networked physical domains , 2010, AAAI 2010.
[12] Alan Washburn,et al. Two-Person Zero-Sum Games for Network Interdiction , 1995, Oper. Res..
[13] Avrim Blum,et al. Planning in the Presence of Cost Functions Controlled by an Adversary , 2003, ICML.
[14] Ely Porat,et al. Path disruption games , 2010, AAMAS.
[15] Joao P. Hespanha,et al. Saddle policies for secure routing in communication networks , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..
[16] Vincent Conitzer,et al. Computing the optimal strategy to commit to , 2006, EC '06.
[17] Vincent Conitzer,et al. Multi-Step Multi-Sensor Hider-Seeker Games , 2009, IJCAI.