Article

Resource distribution in multiple attacks with imperfect detection of the attack outcome.

Collaborative Autonomic Computing Laboratory, School of Computer Science, University of Electronic Science and Technology of China, Chengdu, China.
Risk Analysis (Impact Factor: 2.28). 07/2011; 32(2):304-18. DOI: 10.1111/j.1539-6924.2011.01657.x
Source: PubMed

ABSTRACT This article extends the previous research of consecutive attacks strategy by assuming that an attacker observes the outcome of each attack imperfectly. With given probabilities it may wrongly identify a destroyed target as undestroyed, and wrongly identify an undestroyed target as destroyed. The outcome of each attack is determined by a contest success function that depends on the amount of resources allocated by the defender and the attacker to each attack. The article suggests a probabilistic model of the multiple attacks and analyzes how the target destruction probability and the attacker's relative resource expenditure are impacted by the two probabilities of incorrect observation, the attacker's and defender's resource ratio, the contest intensity, the number of attacks, and the resource distribution across attacks. We analyze how the attacker chooses the number of attacks, the attack stopping rule, and the optimal resource distribution across attacks to maximize its utility.

0 Bookmarks
 · 
66 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider the optimal use of information in shooting at a collection of targets, generally with the object of maximizing the average number (or value) of targets killed. The shooting problem is viewed as a Markov decision process, and the modal solution technique is stochastic dynamic programming. Information obtained about target status may or may not be perfect, and there may or may not be constraints on the number of shots. Previous results are reviewed, and some new results are obtained. Subject classifications: decision analysis: sequential; dynamic programming/optimal control: Markov finite state, Markov infinite state; military: targeting; probability: Markov processes, stochastic model applications. Area of review: Military. History: Received September 2002; accepted February 2003.
    Operations Research. 01/2004; 52:454-463.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This article constructs a foundation for warfare at the individual level, where agents in two groups fire and absorb shots according to a non-stationary Poisson process. We determine for generalized forms of warfare the conditional and unconditional point probabilities of a certain number of agents in each group through time, and the conditional and unconditional expected sizes and variances. Conditional variables are especially useful in modern warfare since these allow for updated intelligence. We determine the conditions for discrepancies between the stochastic version and the associated Lanchester model. Correspondence is demonstrated for square warfare for large groups where the probability that a group goes extinct is negligible. For linear warfare equivalence occurs for the conditional case, whereas for the unconditional case correspondence arises at the limit where the covariance of the group sizes approaches zero. Finally the stochastic model is tested against newly released empirics for the Ardennes Campaign during World War II.
    European Journal of Operational Research 01/2002; · 2.04 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A target is protected by the defender and attacked by an attacker launching sequential attacks. For each attack, a contest intensity measures whether the agents' efforts have low or high impact on the target vulnerability (low vs. high contest intensity). Both the defender and the attacker have limited resources. It is assumed that the attacker can observe the outcome of each attack and stop the sequence of attacks when the target is destroyed. Two attacker objectives are considered, that is, to maximize the target vulnerability or to minimize the expected attacker resource expenditure. The article addresses the following three questions: whether the attacker should allocate its entire resource into one large attack or distribute it among several attacks; whether geometrically increasing or decreasing resource distribution into a fixed number of sequential attacks is more beneficial than equal resource distribution; and how the optimal attack strategy depends on the contest intensity.
    Risk Analysis 04/2010; 30(8):1231-9. · 2.28 Impact Factor

Full-text

Download
0 Downloads
Available from
Nov 6, 2014