Please use this identifier to cite or link to this item: https://doi.org/10.1057/jors.2009.171
Title: Optimal defence of single object with imperfect false targets
Authors: Peng, R.
Levitin, G.
Xie, M. 
Ng, S.H. 
Keywords: attack
defence
false target
vulnerability
Issue Date: Jan-2011
Source: Peng, R.,Levitin, G.,Xie, M.,Ng, S.H. (2011-01). Optimal defence of single object with imperfect false targets. Journal of the Operational Research Society 62 (1) : 134-141. ScholarBank@NUS Repository. https://doi.org/10.1057/jors.2009.171
Abstract: The paper considers an object exposed to external intentional attacks. The defender distributes its resource between deploying false targets and protecting the object. The false targets are not perfect and there is a nonzero probability that a false target can be detected by the attacker. Once the attacker has detected a certain number of false targets, it ignores them and chooses such number of undetected targets to attack that maximizes the probability of the object destruction. The defender decides how many false targets to deploy in order to minimize the probability of the object destruction assuming that the attacker uses the most harmful strategy to attack. The optimal number of false targets and the optimal number of attacked targets are obtained for the case of single and multiple types of the false targets. A methodology of finding the optimal defence strategy under uncertain contest intensity is suggested. © 2011 Operational Research Society Ltd. All rights reserved.
Source Title: Journal of the Operational Research Society
URI: http://scholarbank.nus.edu.sg/handle/10635/63231
ISSN: 01605682
DOI: 10.1057/jors.2009.171
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

12
checked on Dec 13, 2017

WEB OF SCIENCETM
Citations

5
checked on Nov 8, 2017

Page view(s)

19
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.