Rendezvous Search: A Personal Perspective

Steve Alpern ()
Additional contact information
Steve Alpern: Department of Mathematics, The London School of Economics, Houghton Street, London WC2A 2AE, United Kingdom

Operations Research, 2002, vol. 50, issue 5, 772-795

Abstract: The rendezvous-search problem was posed by the author 25 years ago. In its basic form, it asks how two unit speed players can find each other in least expected time, when randomly placed in a known dark region. The problem received little attention until about 10 years ago. This article surveys the rapid progress that has been made since then, and also presents some new results.

Keywords: Search and surveillance: rendezvous search; Games/group decisions: teams (search for similar items in EconPapers)
Date: 2002
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.50.5.772.363 (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:50:y:2002:i:5:p:772-795

Access Statistics for this article

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