arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2210.15045cs.GTmath.OC
收藏

树和完全网络的最优巡逻策略

Optimal Patrolling Strategies for Trees and Complete Networks

Thuy Bui, Thomas Lidbetter

摘要:

我们提出了解决方案,在网络上玩的连续巡逻游戏。在这个零和游戏中,攻击者选择一个时间和地点来攻击一个网络,攻击时间是固定的。巡逻者在网络中巡逻,目的是以最大可能性拦截攻击。我们的主要结果是证明了最近猜想的最佳巡逻策略的树木。该猜想断言,一种称为E-巡逻策略的特定巡逻策略对所有树网络都是最优的。这个猜想以前被认为在有限的一类特殊情况下是正确的。电子巡逻战略的优点是计算和实施简单。我们证明了这个猜想,提出$\varepsilon$ -最优策略的攻击者提供上限的游戏,任意接近下限提供的E-巡逻策略的值。我们还解决了巡逻游戏在某些情况下,为完整的网络。

英文摘要:

We present solutions to a continuous patrolling game played on network. In this zero-sum game, an Attacker chooses a time and place to attack a network for a fixed amount of time. A Patroller patrols the network with the aim of intercepting the attack with maximum probability. Our main result is the proof of a recent conjecture on the optimal patrolling strategy for trees. The conjecture asserts that a particular patrolling strategy called the E-patrolling strategy is optimal for all tree networks. The conjecture was previously known to be true in a limited class of special cases. The E-patrolling strategy has the advantage of being straightforward to calculate and implement. We prove the conjecture by presenting $\varepsilon$-optimal strategies for the Attacker which provide upper bounds for the value of the game that come arbitrarily close to the lower bound provided by the E-patrolling strategy. We also solve the patrolling game in some cases for complete networks.

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

↑