An ambush game with an unknown number of infiltrators

• 成果类型: Article
• 署名作者: Baston, V; Kikuta, K
• 署名单位: University of Southampton; University of Hyogo
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.1040.0122
• 发表日期: 2004
• 页码: 597-605
• 关键词: games/group decisions : noncooperative; ambush game; military : search/surveillance; detecting; infiltration down a channel

摘要

We consider problems in which a defender is attempting to protect a channel from infiltration by laying static underwater devices across the channel. These devices can detect infiltrators that come within a given distance of them, and it is assumed that an infiltrator so detected can be apprehended before he can fulfill his mission. Previous work has concentrated on cases in which there is just one infiltrator and the infiltrator knows both the number of devices and their detection radii, but the emphasis in this paper is on situations in which the defender does not know the number of infiltrators and the: infiltrators have-only partial information about the devices. It is shown that the defender has a strategy that is optimal against any number of infiltrators when the detection radii satisfy certain conditions and, in particular, when the detection radii all lie in specific intervals. In, the latter case, the infiltrators can also act optimally with only partial information concerning the detection devices. In addition, we obtain results giving the number of infiltrators that will ensure that at least one gets through undetected for various types of partial information available to the infiltrators.