{
  "id": "1412.4247",
  "version": "v1",
  "published": "2014-12-13T15:35:53.000Z",
  "updated": "2014-12-13T15:35:53.000Z",
  "title": "Searching for knights and spies: a majority/minority game",
  "authors": [
    "Mark Wildon"
  ],
  "comment": "21 pages, 3 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-12-13T15:35:53.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C57",
      "91A43",
      "91A46"
    ],
    "keywords": [
      "majority/minority game",
      "computational results",
      "nominated persons identity",
      "paper determines",
      "simultaneous optimal strategy"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 21,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1412.4247W"
    }
  }
}