Rendezvous Search on the Line
Author:
- 1 December 1999
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 47 (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 ofn-players in the worst case and show that it has an asymptotic behavior ofn/2 +O(logn).Keywords
This publication has 5 references indexed in Scilit:
- Minimax Rendezvous on the LineSIAM Journal on Control and Optimization, 1996
- Rendezvous Search on the Line with Distinguishable PlayersSIAM Journal on Control and Optimization, 1995
- The Rendezvous Search ProblemSIAM Journal on Control and Optimization, 1995
- Son of the linear search problemIsrael Journal of Mathematics, 1984
- More on the linear search problemIsrael Journal of Mathematics, 1965