arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1806.07111cs.AIcs.GT
收藏

目标报警的对抗性巡逻博弈中的多重攻击

Facing Multiple Attacks in Adversarial Patrolling Games with Alarmed Targets

Politecnico di Milano(米兰理工大学)

Giuseppe De Nittis, Nicola Gatti

摘要:

我们专注于任意图上的对抗性巡逻游戏,其中防御者可以控制移动资源,目标通过警报系统发出警报,攻击者可以观察防御者的移动资源的动作,并利用多个资源执行不同的攻击。这种情况可以被建模为一个零和扩展形式的游戏,其中每个玩家可以玩多次。博弈树在图的大小和攻击资源的数量上都是指数级的。我们证明了当攻击者的资源数量是自由的,平衡路径的计算问题是NP-难的,而当资源数量是固定的,平衡路径可以在多时间计算。我们提供了一个动态规划算法,给定攻击者的资源数量,计算平衡路径,需要多时间的图形的大小和指数时间的资源数量。此外,由于在现实世界中的情况下,这是难以置信的,防御者知道的攻击资源的数量,我们研究的鲁棒性防御者的策略时,她作出了错误的猜测这个数字。我们表明,即使是一个单一的资源的错误,可以导致任意的低效率,当低效率被定义为一个错误的猜测和正确的猜测获得的后卫的效用的比率。然而,一个更合适的低效率定义是由防御者效用的差异给出的:这样,我们观察到估计误差越大,防御者的损失就越大。然后,我们调查的性能时,没有关于攻击者的资源信息的在线算法。最后,我们诉诸随机在线算法表明,我们可以获得一个竞争因素,是两倍以上的一个,可以实现任何确定性的在线算法。

英文摘要:

We focus on adversarial patrolling games on arbitrary graphs, where the Defender can control a mobile resource, the targets are alarmed by an alarm system, and the Attacker can observe the actions of the mobile resource of the Defender and perform different attacks exploiting multiple resources. This scenario can be modeled as a zero-sum extensive-form game in which each player can play multiple times. The game tree is exponentially large both in the size of the graph and in the number of attacking resources. We show that when the number of the Attacker's resources is free, the problem of computing the equilibrium path is NP-hard, while when the number of resources is fixed, the equilibrium path can be computed in poly-time. We provide a dynamic-programming algorithm that, given the number of the Attacker's resources, computes the equilibrium path requiring poly-time in the size of the graph and exponential time in the number of the resources. Furthermore, since in real-world scenarios it is implausible that the Defender knows the number of attacking resources, we study the robustness of the Defender's strategy when she makes a wrong guess about that number. We show that even the error of just a single resource can lead to an arbitrary inefficiency, when the inefficiency is defined as the ratio of the Defender's utilities obtained with a wrong guess and a correct guess. However, a more suitable definition of inefficiency is given by the difference of the Defender's utilities: this way, we observe that the higher the error in the estimation, the higher the loss for the Defender. Then, we investigate the performance of online algorithms when no information about the Attacker's resources is available. Finally, we resort to randomized online algorithms showing that we can obtain a competitive factor that is twice better than the one that can be achieved by any deterministic online algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑