骑士，间谍，游戏和投票序列
Knights, spies, games and ballot sequences
摘要：
本文提出了一个解决骑士和间谍问题的方法：在一个房间里有n个人，每个人都被标记为1到n之间的唯一数字。一个人可以是骑士，也可以是间谍。骑士总是说实话，而间谍可以撒谎或说实话，因为他们认为合适。房间里的每个人都知道其他人的身份。除此之外，所有已知的是，严格来说，骑士比间谍更多。只问这样的问题：“人i，人j的身份是什么？”'，保证找到所有n个人的真实身份的最少问题是多少？一个相关的二人博弈的分析是证明的关键。一些概率方面也进行了探讨。本文最后提出了三个开放的问题与概括的问题。
英文摘要：
This paper presents a solution to the Knights and Spies Problem: In a room there are n people, each labelled with a unique number between 1 and n. A person may either be a knight or a spy. Knights always tell the truth, while spies may either lie or tell the truth, as they see fit. Each person in the room knows the identity of everyone else. Apart from this, all that is known is that strictly more knights than spies are present. Asking only questions of the form: `Person i, what is the identity of person j?', what is the least number of questions that will guarantee to find the true identities of all n people? The analysis of a related two-player game is critical to the proof. Some probabilistic aspects are also explored. The paper ends by presenting three open questions concerned with generalisations of the problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
