Rendezvous search on the line with limited resources: Maximizing the probability of meeting

Rendezvous search on the line with limited resources: Maximizing the probability of meeting

0.00 Avg rating0 Votes
Article ID: iaor20011329
Country: United States
Volume: 47
Issue: 6
Start Page Number: 849
End Page Number: 861
Publication Date: Nov 1999
Journal: Operations Research
Authors: ,
Abstract:

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. If F 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., where one of the players is stationary (zero resources).

Reviews

Required fields are marked *. Your email address will not be published.