Rendezvous on a Planar Lattice

Steve Alpern () and Vic Baston ()
Additional contact information
Steve Alpern: Department of Mathematics, London School of Economics, Houghton Street, London WC2A 2AE, United Kingdom
Vic Baston: Department of Mathematics, University of Southampton, Southampton, Hampshire SO17 1BJ, United Kingdom

Operations Research, 2005, vol. 53, issue 6, 996-1006

Abstract: We analyze the optimal behavior of two players who are lost on a planar surface and who want to meet each other in least expected time. They each know the initial distribution of the other’s location, but have no common labeling of points, and so cannot simply go to a location agreed to in advance. They have no compasses, so do not even have a common notion of North. For simplicity, we restrict their motions to the integer lattice Z 2 (graph paper) and their motions to horizontal and vertical directions, as in the original work of Anderson and Fekete (2001).

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1050.0217 (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:53:y:2005:i:6:p:996-1006

Access Statistics for this article

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