Disperse or unite? a mathematical model of coordinated attack

Authors:
Steve Alpern;Robbert Fokkink;Joram Op Den Kelder;Tom Lidbetter
Affiliations:
London School of Economics, Department of Mathematics, London, United Kingdom;Delft University, Faculty of Electrical Engineering, Mathematics and Information Technology, Delft, The Netherlands;Delft University, Faculty of Electrical Engineering, Mathematics and Information Technology, Delft, The Netherlands;London School of Economics, Department of Mathematics, London, United Kingdom
Venue:
GameSec'10 Proceedings of the First international conference on Decision and game theory for security
Year:
2010

Citing 4
Cited 0

A mixed-strategy minimax theorem without compactness

SIAM Journal on Control and Optimization
Introduction to Algorithms

Introduction to Algorithms
Finding a moving fugitive. A game theoretic representation of search

Computers and Operations Research
Mathematical Methods in Counterterrorism

Mathematical Methods in Counterterrorism

Quantified Score

Hi-index	0.00

Visualization

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.