Library Header Image
LSE Research Online LSE Library Services

Rendezvous search on a graph

Alpern, Steven, Baston, V. and Essegaier, S. (1999) Rendezvous search on a graph. Journal of Applied Probability, 36 (1). pp. 223-231. ISSN 0021-9002

Full text not available from this repository.


Two agents are placed randomly on nodes of a known graph. They are aware of their own position, up to certain symmetries of the graph, but not that of the other agent. At each step, each agent may stay where he is or move to an adjacent node. Their common aim is to minimize the expected number of steps required to meet (occupy the same node). We consider two cases determined by whether or not the players are constrained to use identical strategies. This work extends that of Anderson and Weber on `discrete locations' (complete graph) and is related to continuous (time and space) rendezvous as formulated by Alpern. Probabilistic notions arise in the random initial placement, in the random symmetries determining spatial uncertainty of agents, and through the use of mixed strategies.

Item Type: Article
Official URL:
Additional Information: © 1999 Journal of Applied Probability
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 13 Feb 2010 12:04
Last Modified: 30 Sep 2021 23:06

Actions (login required)

View Item View Item