Please use this identifier to cite or link to this item:
Title: Rendezvous search on the line with more than two players
Authors: Lim, W.S. 
Alpern, S.
Beck, A.
Issue Date: 1997
Citation: Lim, W.S.,Alpern, S.,Beck, A. (1997). Rendezvous search on the line with more than two players. Operations Research 45 (3) : 357-364. ScholarBank@NUS Repository.
Abstract: Suppose n blind, speed one, players are placed by a random permutation onto the integers 1 to n, and each is pointed randomly to the right or left. What is the least expected time required for m ≤ n of them to meet together at a single point? If they must all use the same strategy we call this time the symmetric rendezvous value Rn,m s; otherwise the asymmetric value Rn,m a. We show that R3,2 a = 47/48, and that Rn,ns, is asymptotic to n/2. These results respectively extend those for two players given by Alpern and Gal (1995) and Anderson and Essegaier (1995). © 1997 INFORMS.
Source Title: Operations Research
ISSN: 0030364X
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Jan 26, 2023

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.