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).
|Number of pages||3|
|State||Published - 1999|
ASJC Scopus subject areas
- Computer Science Applications
- Management Science and Operations Research