Please use this identifier to cite or link to this item:
|Title:||Minimax rendezvous on the line||Authors:||Lim, W.S.
|Issue Date:||1996||Citation:||Lim, W.S.,Alpern, S. (1996). Minimax rendezvous on the line. SIAM Journal on Control and Optimization 34 (5) : 1650-1665. ScholarBank@NUS Repository.||Abstract:||Suppose that n players are placed randomly on the real line at consecutive integers, and faced in random directions. Each player has maximum speed one, cannot see the others, and doesn't know his relative position. What is the minimum time Mn required to ensure that all the players can meet together at a single point, regardless of their initial placement? We prove that M2 = 3, M3 = 4, and Mn is asymptotic to n/2. We also consider a variant of the problem which requires players who meet to stick together, and find in this case that three players require 5 time units to ensure a meeting. This paper is thus a minimax version of the rendezvous search problem, which has hitherto been studied only in terms of minimizing the expected meeting time.||Source Title:||SIAM Journal on Control and Optimization||URI:||http://scholarbank.nus.edu.sg/handle/10635/44801||ISSN:||03630129|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.