Pure strategy asymmetric rendezvous on the line with an unknown initial distance
成果类型：
Article
署名作者：
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.48.3.498.12432
发表日期：
2000
页码：
498-501
关键词：
摘要：
Suppose two blind agents with unit speed are placed a distance H apart on an infinite line, and faced in random directions. Their initial distance H is picked from a distribution F with finite mean mu. We present a pair of rendezvous strategies which do not depend on the distribution F and ensure a meeting in expected time less than 5.514 mu. This improves the bound of 5.74 mu given by Baston and Gal. Furthermore, the bound we give is best possible for strategies of our type.