Rendezvous search on the line with more than two players
成果类型：
Article
署名作者：
Lim, WS; Alpern, S; Beck, A
署名单位：
University of London; London School Economics & Political Science; University of Wisconsin System; University of Wisconsin Madison
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.45.3.357
发表日期：
1997
页码：
357-364
关键词：
摘要：
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 less than or equal to 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 R-n,m(s); otherwise the asymmetric value R-n,m(a). We show that R-3,2(a) = 47/48, and that R-n,n(s), is asymptotic to n/2. These results respectively extend those for two players given by Alpern and Gal (1995) and Anderson and Essegaier (1995).