Abstract
The arrest of Saddam Hussein on 13th of December 2003 in a farmhouse near his hometown of Tikrit marked the end of military operation Red Dawn, a man hunt that had been planned by Major Brian J. Reed, who traced Saddam using social network analysis. Major Reed stated that: the intelligence background and link diagrams that we built were rooted in the concepts of network analysis [24]. The process of daily intelligence gathering led coalition forces to identify and locate more of the key players in the insurgent network [29]. This finally resulted in diagrams of Saddam’s highly trusted relatives and clan members. A series of raids designed to capture some of those key individuals finally led to the information necessary to find Hussein. Operation Red Dawn took approximately half a year.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Alpern S, Asic M (1986) Ambush strategies in search games on graphs. SIAM J Control Optim 24(1):66–75
Alpern S, Gal S (2003) The theory of search games and rendezvous. International series in management science, vol 55. Kluwer, New York
Alpern S, Baston V, Gal S (2008) Network search games with immobile hider without a designated starting point. Int J Game Theory 37:281–302
Alpern S, Fokkink R, Lindelauf R, Olsder GJ (2008) The princess and monster game on an interval. SIAM J Control Optim 47(3):1178–1190
Alpern S, Fokkink R, Op den Kelder J, Lidbetter T (2010) Disperse or unite, a model of coordinated attack. In: Proceedings of the first international conference on decisions and games for security (GameSec), Berlin. pp 220–233
Alpern S, Fokkink R, Gal S, Timmer M (2011) On search games that involve ambush (reprint, 2012)
Alpern S, Fokkink R, Timmer M, Casas J (2011) Ambush frequency should increase over time during optimal predator search for prey. J R Soc Interface 8(64):1665–1672. doi: 10.1098/rsif.2011.0154
Alpern S, Papadaki K, Morton A (2011) Patrolling games. Oper Res 59(5):1246–1257
Anderson EJ, Aramendia MA (1990) The search game on a network with immobile hider. Networks 20(7):817–844
Anderson EJ, Aramendia MA (1992) A linear programming approach to the search game on a network with mobile hider. SIAM J Control Optim 30(3):675–694
Bier V, Olivers S, Samuelson L (2007) Choosing what to protect. Defensive allocation against an unknown attacker. J Publ Econ Theory 9(4):563–587
Bonato A, Nowakowski RJ (2011) The game of cops and robbers on graphs. AMS Student Mathematical Library 61, 2011
Chrobak M (2004) A princess swimming in the fog looking for a monster cow. ACM SIGACT News 35(2):74–78. doi:10.1145/992287.992304
Dickerson JP, Simari G, Subrahmanian VS, Kraus S (2010) A graph-theoretic approach to protect static and moving targets from adversaries. In: Proceeding of the ninth international conferences on autonomous agents and multiagent systems (AAMAS-2010), Toronto. pp 299–306
Fokkink R, Stassen M (2011) An asymptotic solution of Dresher’s Guessing game, second international conferences on decisions and games for security (GameSec), Maryland. pp 104–116
Gal S (1979) Search games with mobile and immobile hider. SIAM J Control Optim 17(1): 99–122. doi:10.1137/0317009
Gal S (1980) Search games. Academic, New York
Gal S (2000) On the optimality of a simple strategy for searching graphs. Int J Game Theory 29:533–542
Garnaev AY (1992) A remark on the Princess and Monster search game. Int J Game Theory 20(3):269–276. doi:10.1007/BF01253781
Garnaev AY (2000) Search games and other applications of game theory. Springer, Berlin
Gill P, Phythian M (2006) Intelligence in an insecure world. Polity Press, Cambridge
Gueye A, Walrand JC, Anantharam V (2010) Design of network topology in an adverserial environment. In: Proceedings of the first international conference on decisions and games for security (GameSec), Berlin. pp 1–20
Herman M (1996) Intelligence power in peace and war. Cambridge University Press, Cambridge
Hougham V (2008) Sociological skills used in the capture of Saddam Hussein. Footnotes 33(6). http://wwww.asanet.org/footnote/julyaugust05/index.html
Isaacs R (1965) Differential games, a mathematical theory with applications to warfare and pursuit, control and optimization. Wiley, New York
Lalley S, Robbins H (1987) Asymptotically minimax stochastic search strategies in the plane. Proc Natl Acad Sci 84(8):2111–2112
Megiddo N, Hakimi SL, Garey MR, Johnson DS, Papadimitriou C (1988) The complexity of searching a graph. J ACM 35(1):18–44
Owen G, McCormick GH (2008) Finding a moving fugitive. A game theoretic representation of search. Comput Oper Res 35:1944–1962
Petraeus H, Amos JF (2007) Counterinsurgency field manual, U.S. Army Field Manual on Tactics, Intelligence, Host Nation Forces, Airpower, University of Chicago Press, Chicago
Potters JAM, Reijnierse JH (1993) Search games with immobile hider. Int J Game Theory 21:385–394
Ruckle W (1983) Geometric games and their applications. Pitman, London
Scheinerman ER, Ullman DH (2008) Fractional graph theory. http://www.ams.jhu.edu/ers/fgt
Timmer M (2008) Rendezvous on an interval and a search game on a star. MSc thesis, TU Delft. repository.tudelft.nl
Von Stengel B, Werchner R (1997) Complexity of searching an immobile hider in a graph. Discret Appl Math 78:235–249
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Fokkink, R., Lindelauf, R. (2013). The Application of Search Games to Counter Terrorism Studies. In: Subrahmanian, V. (eds) Handbook of Computational Approaches to Counterterrorism. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-5311-6_24
Download citation
DOI: https://doi.org/10.1007/978-1-4614-5311-6_24
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-5310-9
Online ISBN: 978-1-4614-5311-6
eBook Packages: Computer ScienceComputer Science (R0)