Skip to main content
Article thumbnail
Location of Repository

Rendezvous-evasion search in two boxes with incomplete information

By S. Gal and J. V. Howard


An agent (who may or may not want to be found) is located in one of two boxes. At time 0 suppose that he is in box B. With probability p he wishes to be found, in which case he has been asked to stay in box B. With probability p he tries to evade the searcher, in which case he may move between boxes A and B. The searcher looks into one of the boxes at times 1, 2, 3, ... . Between each search the agent may change boxes if he wants. The searcher is trying to minimise the expected time to discovery. The agent is trying to minimise this time if he wants to be found, but trying to maximise it otherwise. This paper nds a solution to this game (in a sense defined in the paper), associated strategies for the searcher and each type of agent, and a continuous value function v(p) giving the expected time for the agent to be discovered. The solution method (which is to solve an associated zero-sum game) would apply generally to this type of game of incomplete information

Topics: QA Mathematics
Publisher: Department of Operational Research, London School of Economics and Political Science
Year: 2003
OAI identifier:
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • (external link)
  • Suggested articles


    1. (1998). Rendezvous Search on the Interval and the Circle, doi
    2. (2002). Searching for an Agent who may or may not Want to be Found, doi
    3. (1990). The Rendezvous Problem on Discrete Locations, doi
    4. (1995). The Rendezvous Search Problem, doi
    5. (2003). The Theory of Search Games and Rendezvous, Kluwer,

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.