Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/44956
DC FieldValue
dc.titleRendezvous search on the line with more than two players
dc.contributor.authorLim, W.S.
dc.contributor.authorAlpern, S.
dc.contributor.authorBeck, A.
dc.date.accessioned2013-10-10T04:38:39Z
dc.date.available2013-10-10T04:38:39Z
dc.date.issued1997
dc.identifier.citationLim, 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.
dc.identifier.issn0030364X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/44956
dc.description.abstractSuppose 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.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentDECISION SCIENCES
dc.description.sourcetitleOperations Research
dc.description.volume45
dc.description.issue3
dc.description.page357-364
dc.description.codenOPREA
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

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

Page view(s)

117
checked on Dec 8, 2022

Google ScholarTM

Check


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