Rendezvous-Evasion Search in Two Boxes

S. Gal () and J. V. Howard ()
Additional contact information
S. Gal: Department of Statistics, University of Haifa, Haifa 31905, Israel
J. V. Howard: Department of Statistics, London School of Economics, Houghton Street, London WC2A 2AE, United Kingdom

Operations Research, 2005, vol. 53, issue 4, 689-697

Abstract: 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 1−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 finds 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.

Keywords: search and surveillance:rendezvous search; evasion search; games and group decisions:teams (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1040.0198 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:53:y:2005:i:4:p:689-697

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().