arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1412.4247math.CO
收藏

寻找骑士和间谍:多数/少数游戏

Searching for knights and spies: a majority/minority game

Mark Wildon

摘要:

有n个人,每个人不是骑士就是间谍。已知至少存在k个骑士,其中n/2 < k < n。骑士总是说实话我们认为间谍总是说谎和间谍谁回答他们认为合适的。这篇论文确定了找到间谍或证明房间里的每个人都是骑士所需的问题数量。我们还确定了至少需要找到一个人的身份,或指定的人的身份,或找到一个间谍(假设间谍存在)的最低数量的问题。对于总是说谎的间谍,我们证明了这些搜索问题,以及找到一个骑士的问题,可以解决的同时最优策略。我们也给出了一些计算结果的问题,发现所有身份时,间谍总是说谎,并结束了一些公开的问题。

英文摘要:

There are n people, each of whom is either a knight or a spy. It is known that at least k knights are present, where n/2 < k < n. Knights always tell the truth. We consider both spies who always lie and spies who answer as they see fit. This paper determines the number of questions required to find a spy or prove that everyone in the room is a knight. We also determine the minimum number of questions needed to find at least one person's identity, or a nominated person's identity, or to find a spy (under the assumption that a spy is present). For spies who always lie, we prove that these searching problems, and the problem of finding a knight, can be solved by a simultaneous optimal strategy. We also give some computational results on the problem of finding all identities when spies always lie, and end by stating some open problems.

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

↑