Rendezvous search on the interval and the circle
成果类型：
Article
署名作者：
Howard, JV
署名单位：
University of London; London School Economics & Political Science
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.47.4.550
发表日期：
1999
页码：
550-558
关键词：
摘要：
Two people are placed randomly and independently on a street of unit length. They attempt to find each other in the shortest possible expected time. We solve this problem, assuming each searcher knows where he or she is on the street, for monotonic density functions for the initial placement (this includes the uniform pdf as a special case). This gives an example of a rendezvous search problem where there is no advantage in being allowed to use asymmetric strategies. We also solve some corresponding problems for the circle when asymmetric strategies are permitted: One of these shows that it can sometimes be optimal for one player to wait for the other to find him.