Cops and Lethal Robber on Rings: A Distributed Perspective

2026-09-06

AI Summary

本文研究了在分布式环境下带有致命攻击能力的抢劫者问题，提出了一种新的模型，并证明了解决该问题所需最少警察数量为n+⌊log n⌋+4。

Abstract

The Cops and Robber game is extensively studied in the sequential setting where the main goal is to capture the robber. Capturing the robber means at least one cop, and the robber will be at the same vertex together at some time. There are several variants, including variants where the goal of the cops is to surround the robber. Surrounding the robber means there is at least one cop in each of the neighboring vertices of the robber's position. In this paper, we introduce it in the distributed setting while empowering the robber by saying it can even kill cops. Specifically, in our model, the robber moves in odd rounds and has unbounded speed, cops move in even rounds, and if one or more cops move into a vertex where the robber is currently residing, all these cops get killed. We call this {\it lethal robber}. This also connects our work to the Intruder Capture and Black Hole Search problems by introducing an entity which is dynamic as well as lethal, a setting that, to the best of our knowledge, has not been studied. In this work, we introduce the lethal robber, define the {\it cops and lethal robber} problem in the distributed setting and study it on a static ring of size $n$. We prove $n$ cops are not enough, even if all start from the same vertex, and provide an algorithm starting from an arbitrary initial configuration that requires $n+\lfloor\log n \rfloor+4$ cops in the worst case.

Problem

• Cops and Robber
• Distributed Setting
• Lethal Robber
• Intruder Capture
• Black Hole Search

Innovation

• lethal robber
• distributed setting
• unbounded speed
• ring network
• cops and lethal robber