Pure Strategy Asymmetric Rendezvous on the Line with an Unknown Initial Distance

Steve Alpern () and Anatole Beck ()
Additional contact information
Steve Alpern: Department of Mathematics, London School of Economics, Houghton Street, London WC2A 2AE, United Kingdom
Anatole Beck: Department of Mathematics, London School of Economics, Houghton Street, London WC2A 2AE, United Kingdom and Department of Mathematics, University of Wisconsin, Madison, Wisconsin 53706

Operations Research, 2000, vol. 48, issue 3, 498-501

Abstract: 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.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.48.3.498.12432 (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:48:y:2000:i:3:p:498-501

Access Statistics for this article

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