Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Settling the Complexity of Two-Player Nash Equilibrium
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Mining for offender group detection and story of a police operation
AusDM '07 Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70
Dealing with Lashkar-e-Taiba: A Multi-player Game-Theoretic Perspective
EISIC '11 Proceedings of the 2011 European Intelligence and Security Informatics Conference
Computational Analysis of Terrorist Groups: Lashkar-e-Taiba
Computational Analysis of Terrorist Groups: Lashkar-e-Taiba
Covertness Centrality in Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Hi-index | 0.00 |
We consider the problem of dealing with the terrorist group Lashkar-e-Taiba (LeT), responsible for the 2008 Mumbai attacks, as a five-player game. However, as different experts vary in their assessment of players' payoffs in this game (and other games), we identify multi-payoff equilibria through a novel combination of vector payoffs and well-supported ∈-approximate equilibria. We develop a grid search algorithm for computing such equilibria, and provide experimental validation using three payoff matrices filled in by experts in India-Pakistan relations. The resulting system, called PREVE, allows us to analyze the equilibria thus generated and suggest policies to reduce attacks by LeT. We briefly discuss the suggested policies and identify their strengths and weaknesses.