Disperse or unite? A mathematical model of coordinated attack

Steve Alpern, Robbert Fokkink, Joram Op Den Kelder, Tom Lidbetter

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationDecision and Game Theory for Security - First International Conference, GameSec 2010, Proceedings
Pages220-233
Number of pages14
DOIs
StatePublished - 2010
Externally publishedYes
Event1st International Conference on Decision and Game Theory for Security, GameSec 2010 - Berlin, Germany
Duration: Nov 22 2010Nov 23 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6442 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Conference on Decision and Game Theory for Security, GameSec 2010
Country/TerritoryGermany
CityBerlin
Period11/22/1011/23/10

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Keywords

  • near value
  • probability of dispersion
  • zero-sum game

Fingerprint

Dive into the research topics of 'Disperse or unite? A mathematical model of coordinated attack'. Together they form a unique fingerprint.

Cite this