Patrolling Games were introduced by Alpern, Morton and Papadaki (2011) to model the adversarial problem where a mobile Patroller can thwart an attack at some location only by visiting it during the attack period, which has a prescribed integer duration m. Here, we modify the problem by allowing the Attacker to go to his planned attack location early and observe the presence or the absence there of the Patroller (who wears a uniform). To avoid being too predictable, the Patroller may sometimes remain at her base when she could have been visiting a possible attack location. The Attacker can then choose to delay attacking for some number of periods d after the Patroller leaves his planned attack location. As shown here, this extra information for the Attacker can reduce thwarted attacks by as much as a factor of four in specific models. Our main finding, is that the attack should begin in the second period the Patroller is away (d = 2) and that the Patroller should never attack the same location in consecutive periods.
翻译:Alpern、Morton和Papadaki(2011年)引入了巡逻运动会,以模拟对抗性问题,即机动巡逻员只有在攻击期间访问某个地点才能挫败攻击,而攻击期间该地点有一定的整数长度。这里,我们通过允许攻击者提前前往其计划的攻击地点观察巡逻员(穿制服的巡逻员)的存在或缺席来改变问题。为了避免过于可预测,巡逻员有时在可能访问攻击地点时可能留在基地。攻击者随后可以选择在巡逻员离开其计划的攻击地点后推迟一些时间。这里显示,攻击者的这一额外信息可以在特定模式中减少受挫攻击的4倍。我们的主要发现是,攻击应始于巡逻员离开的第二个期间(d=2),巡逻员不应连续袭击同一地点。