Return
Infrastructure security games
DOI:10.1016/j.ejor.2014.04.033.png)
Abstract
En 中文
Infrastructure security against possible attacks involves making decisions under uncertainty. This paper presents game theoretic models of the interaction between an adversary and a first responder in order to study the problem of security within a transportation infrastructure. The risk measure used is based on the consequence of an attack in terms of the number of people affected or the occupancy level of a critical infrastructure, e.g. stations, trains, subway cars, escalators, bridges, etc. The objective of the adversary is to inflict the maximum damage to a transportation network by selecting a set of nodes to attack, while the first responder (emergency management center) allocates resources (emergency personnel or personnel-hours) to the sites of interest in an attempt to find the hidden adversary. This paper considers both static and dynamic, in which the first responder is mobile, games. The unique equilibrium strategy pair is given in closed form for the simple static game. For the dynamic game, the equilibrium for the first responder becomes the best patrol policy within the infrastructure. This model uses partially observable Markov decision processes (POMDPs) in which the payoff functions depend on an exogenous people flow, and thus, are time varying. A numerical example illustrating the algorithm is presented to evaluate an equilibrium strategy pair. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Uncertainty modeling
Game theory
Matrix game
Bayesian game
Moving targets
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
Studies in chromone derivatives: cycloaddition reactions of 4-oxo 4h-1-benzopyran-3-carboxaldehyde imines with benzonitrile oxide and nitrilimine of 4-oxo-4h-1-benzopyran-3-carboxaldehyde with alkenes
Tetrahedron
IF0

