制服巡警游戏
The Uniformed Patroller Game
摘要:
在最近引入的网络巡逻游戏中,攻击者在她选择的节点上进行攻击,持续给定的连续时间段m。参数m表示在给定节点处攻击的难度。为了阻止这种攻击,巡逻者在网络上采取行走,希望在m个周期中的一个周期内到达受攻击节点。如果发生这种情况,攻击被中断,巡逻者获胜;否则攻击者获胜。在最初的设定中,攻击者在任何时候都不知道巡逻者的位置。在这里,为了模拟巡逻者在攻击者的节点时可以被识别的重要替代方案(例如,巡逻者穿着制服),我们允许攻击者在等待巡逻者离开的连续时间段的选定数量d之后发起攻击。我们解决这个版本的游戏的各种网络:星,线,圆和混合物。我们将巡逻者限制为马尔可夫策略,它覆盖了整个网络。
英文摘要:
In the recently introduced network patrolling game, an Attacker carries out an attack on a node of her choice, for a given number m of consecutive periods. The parameter m indicates the difficulty of the attack at a given node. To thwart such an attack, the Patroller adopts a walk on the network, hoping to be at the attacked node during one of the m periods. If this occurs, the attack is interrupted and the Patroller wins; otherwise the Attacker wins. In the original setting, the Attacker has no knowledge of the Patroller's location at any time. Here, to model the important alternative where the Patroller can be identified when he is at the Attacker's node (e.g. the Patroller wears a uniform), we allow the Attacker to initiate her attack after waiting for a chosen number d of consecutive periods in which the Patroller has been away. We solve this version of the game for various networks: star, line, circle and a mixture. We restrict the Patroller to Markovian strategies, which cover the whole network.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。