Rendezvous search on the line with limited resources: Maximizing the probability of meeting
成果类型：
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.47.6.849
发表日期：
1999
页码：
849-861
关键词：
摘要：
Two players are placed on a line at a distance d which is drawn from a known distribution F. The players have no common notion of direction on the line, and each has a resources bound on the total distance he can travel. VF is bounded and the resources are sufficiently large, then the players can ensure a meeting. The expected time minimization problem in that case has been studied by the authors in a previous paper. Aside from that case the most the players can do is maximize the probability that they meet. This is the problem studied here, for general and specific distributions. This problem generalizes that of Foley et al. (1991), where one of the players is stationary (zero resources).