Skip to main content
SpringerLink
Log in

Disperse or Unite? A Mathematical Model of Coordinated Attack

  • Conference paper
Decision and Game Theory for Security (GameSec 2010)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 6442))

Included in the following conference series:

Abstract

We introduce a new type of search game that involves a group of immobile hiders rather than a single hider. We provide the mathematical framework for the game and we show that the game is useful to understand under what conditions attackers disperse or unite.

This work was supported by NWO Visitor Grant 2010/04308 and NATO Collaborative Research Grant 983583.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alpern, S., Clayton, N., Fokkink, R., Lidbetter, T.: A game theoretic model for nut caching by scatter hoarders (2010) (preprint)

    Google Scholar 

  2. Alpern, S., Gal, S.: A Mixed Strategy Minimax Theorem without Compactness. SIAM J. Control Optim. 26, 1357–1361 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  3. Alpern, S., Gal, S.: The theory of search games and rendezvous. Kluwer, Dordrecht (2003)

    MATH  Google Scholar 

  4. Bier, V., Olivers, S., Samuelson, L.: Choosing what to protect. Defensive allocation against an unknown attacker. J. Publ. Economic Th. 9(4), 563–587 (2007)

    Article  Google Scholar 

  5. Cormen, T.H., Leiserson, C.E., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill, New York (2002)

    MATH  Google Scholar 

  6. Garnaev, A.Y.: Search games and other applications of game theory. Springer, Heidelberg (2000)

    Book  MATH  Google Scholar 

  7. McEliece, R., Posner, E.: Hiding and covering in a compact metric space. Ann. Stat. 1(4), 729–739 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  8. Memon, N., Farley, J.D., Hicks, D.L., Rosenorn, T.: Mathematical methods in counterterrorism. Springer, Heidelberg (2009)

    Book  MATH  Google Scholar 

  9. Owen, G., McCormick, G.H.: Finding a moving fugitive. A game theoretic representation of search. Comp. Oper. Res. 35, 1944–1962 (2008)

    Article  MATH  Google Scholar 

  10. Reijnierse, J.H., Potters, J.A.M.: Search games with an immobile hider. Int. J. Game Theory 21, 385–394 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  11. Ruckle, W.H.: Geometric games and their applications. Pitman (1983)

    Google Scholar 

  12. Statement of Peter Clarke, head of Scotland Yard’s anti-terrorist branch (August 10, 2006), http://news.bbc.co.uk/2/hi/4778575.stm

  13. Zoroa, N., Zoroa, P., Fernández-Sáez, M.J.: Weighted search games. European J. Oper. Res. 195, 394–411 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, London School of Economics, Houghton Street, London, WC2A 2AE, United Kingdom

    Steve Alpern & Tom Lidbetter

  2. Faculty of Electrical Engineering, Mathematics and Information Technology, Delft University, P.O.Box 5031, 2600, GA, Delft, Netherlands

    Robbert Fokkink & Joram op den Kelder

Authors
  1. Steve Alpern
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robbert Fokkink
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joram op den Kelder
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tom Lidbetter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Deutsche Telekom Laboratories, Technische Universität Berlin, 10587, Berlin, Germany

    Tansu Alpcan

  2. Laboratory of Cryptography and System Security (CrySyS), Budapest University of Technology and Economics, Budapest, Hungary

    Levente Buttyán

  3. Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA

    John S. Baras

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alpern, S., Fokkink, R., op den Kelder, J., Lidbetter, T. (2010). Disperse or Unite? A Mathematical Model of Coordinated Attack. In: Alpcan, T., Buttyán, L., Baras, J.S. (eds) Decision and Game Theory for Security. GameSec 2010. Lecture Notes in Computer Science, vol 6442. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17197-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17197-0_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17196-3

  • Online ISBN: 978-3-642-17197-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation