Rendezvous search on the line

Research output: Contribution to journalArticlepeer-review


Two new results for the asymmetric rendezvous problem on the line are presented. It is shown that it is never optimal for one player to be stationary during the entire search period in the two-player rendezvous. The meeting time of n-players in the worst case is considered which shows that its has an asymptotic behavior of n/2+O(log n).

Original languageEnglish
Pages (from-to)974-976
Number of pages3
JournalOperations Research
Issue number6
StatePublished - 1999

ASJC Scopus subject areas

  • Computer Science Applications
  • Management Science and Operations Research


Dive into the research topics of 'Rendezvous search on the line'. Together they form a unique fingerprint.

Cite this