Rendezvous Search on the Line

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 ofn-players in the worst case and show that it has an asymptotic behavior ofn/2 +O(logn).