Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Cost-effective outbreak detection in networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Multi-step multi-sensor hider-seeker games
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Extracting influential nodes on a social network for information diffusion
Data Mining and Knowledge Discovery
Scalable influence maximization for prevalent viral marketing in large-scale social networks
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Limiting the spread of misinformation in social networks
Proceedings of the 20th international conference on World wide web
A double oracle algorithm for zero-sum security games on graphs
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
A unified method for handling discrete and continuous uncertainty in Bayesian Stackelberg games
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Hi-index | 0.00 |
Counterinsurgency, which is the effort to mitigate support for an opposing organization, is one such domain that has been studied recently and past work has modeled the problem as an influence blocking maximization that features an influencer and a mitigator. While past work has introduced scalable heuristic techniques for generating effective strategies using a double oracle algorithm, it has not addressed the issue of uncertainty and asymmetric information, which is the topic of this paper.