用警察策略图定位强盗:细分与多警察
Locating Robber with Cop Strategy Graph: Subdivision vs. Multiple Cop
AI总结:
本文通过状态变量和警察策略图构造,结合算法与伪代码,重新分析定位数与细分数的关系,并给出非线性方向的显式结果。
摘要:
我们研究强盗定位博弈:一个不可见的移动强盗试图躲避一个或多个直升机警察的追捕,警察可以从图上的任意位置发送距离探测。本文尝试为该博弈中的一般问题提出两种有用的构造:一种描述警察可用博弈信息的状态变量,以及一种警察策略图构造,用于在给定确定性警察策略下呈现博弈的所有可能性。然后,我们将利用它们以及算法和伪代码,解释两个图参数——定位数和细分数的关系。研究者已经证明后者与前者存在线性关系,而另一个方向不成立。我们将重新审视他们的证明,通过我们提出的构造巩固这两个数之间的本质对应关系,并给出非线性关系的显式结果。
英文摘要:
We consider the Robber Locating Game, where an invisible moving robber tries to evade the pursuit of one or more helicopter cops, who send distance probes from anywhere on the graph. In this paper, we attempt to propose two useful constructions for general problems in this game: a state variable that describes the available game information for the cops, and a Cop Strategy Graph construction that presents all possibilities of the game given a deterministic cop strategy. Then we will use them, along with algorithms and pseudo-code, to explain the relationship between two graph parameters, the localization number and the subdivision number. Researchers have shown that the later has a linear relationship with the former, while the other direction does not. We will revisit their proofs, consolidate the essential correspondence between the two numbers via our proposed constructions, and show an explicit result for the non-linear relationship.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。