Rendezvous Search on the Line

Shmuel Gal
Additional contact information
Shmuel Gal: Department of Statistics, Haifa University, Mount Carmel, Haifa 31905, Israel

Operations Research, 1999, vol. 47, issue 6, 974-976

Abstract: We present two new results for the asymmetric rendezvous problem on the line. We first show that it is never optimal for one player to be stationary during the entire search period in the two-player rendezvous. Then we consider the meeting time of n -players in the worst case and show that it has an asymptotic behavior of n /2 + O (log n ).

Keywords: military; search/surveillance; rendezvous (search for similar items in EconPapers)
Date: 1999
References: View complete reference list from CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.47.6.974 (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:6:p:974-976

Access Statistics for this article

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