We present two new results for the asymmetric rendezvous problem on the lin
e. We first show that it is never optimal for one player to be stationary d
uring the entire search period in the two-player rendezvous. Then we consid
er the meeting One of n-players in the worst case and show that it has an a
symptotic behavior of n/2 + O(log n).