Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting

Steve Alpern and Anatole Beck
Additional contact information
Steve Alpern: Mathematics Department, London School of Economics, London, WC2A 2AE, England
Anatole Beck: Mathematics Department, University of Wisconsin, Madison, Wisconsin 53706

Operations Research, 1999, vol. 47, issue 6, 849-861

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

Keywords: search and surveillance; rendezvous search (search for similar items in EconPapers)
Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.47.6.849 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:47:y:1999:i:6:p:849-861

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().