Rendezvous Search on the Interval and the Circle

J. V. Howard
Additional contact information
J. V. Howard: Department of Operational Research, London School of Economics, Houghton Street, London, WC2A 2AE, United Kingdom

Operations Research, 1999, vol. 47, issue 4, 550-558

Abstract: Two people are placed randomly and independently on a street of unit length. They attempt to find each other in the shortest possible expected time. We solve this problem, assuming each searcher knows where he or she is on the street, for monotonic density functions for the initial placement (this includes the uniform pdf as a special case). This gives an example of a rendezvous search problem where there is no advantage in being allowed to use asymmetric strategies. We also solve some corresponding problems for the circle when asymmetric strategies are permitted: One of these shows that it can sometimes be optimal for one player to wait for the other to find him.

Keywords: search and surveillance; rendezvous search on the interval and the circle (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.47.4.550 (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:47:y:1999:i:4:p:550-558

Access Statistics for this article

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