Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-26T16:09:20.614Z Has data issue: false hasContentIssue false
  • English
  • Français

Rendezvous search on a graph

Part of: Operations research and management science

Published online by Cambridge University Press:  14 July 2016

Steve Alpern ,
V. J. Baston  and
Skander Essegaier
Steve Alpern*
Affiliation:
London School of Economics
V. J. Baston*
Affiliation:
University of Southampton
Skander Essegaier*
Affiliation:
Columbia University
*
∗Postal address: Mathematics Department, London School of Economics, Houghton St, London WC2A 2AE, UK. Email address: alpern@lse.ac.uk. Supported by NATO Collaborative Research Grant #972991
∗∗Postal address: Faculty of Mathematical Studies, University of Southampton, Highfield, Southampton SO9 5NH, UK.
∗∗∗Postal address: Columbia University, Graduate School of Business, Uris Hall #804, New York, NY 10027, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Keywords

Rendezvous searchsearch game

MSC classification

Primary: 90B40: Search theory
Type
Research Papers
Information
Journal of Applied Probability , Volume 36 , Issue 1 , March 1999 , pp. 223 - 231
Copyright
Copyright © Applied Probability Trust 1999 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Aleniunas, R., Karp, R. M., Lipton, R. J., Lovasz, L., and Rackoff, C. (1979). Random walks, universal traversal sequences, and the complexity of maze problems. In 20th annual symposium on Foundations of Computer Science. IEEE, New York, pp. 218–223.Google Scholar
Alpern, S. (1995). The rendezvous search problem. SIAM J. Control Optim. 33, 673–683.CrossRefGoogle Scholar
Alspach, B. (1981). The search for long paths and cycles in vertex-transitive graphs and digraphs. In Combinatorial Mathematics VIII, ed. McAvaney, K. L. (Lecture Notes in Math. 884). Springer, Berlin, pp. 14–22.Google Scholar
Anderson, E. J., and Weber, R. R. (1990). The rendezvous problem on discrete locations. J. Appl. Prob. 28, 839–851.CrossRefGoogle Scholar
Beck, A. (1964). On the linear search problem. Israel J. Math. 2, 221–228.Google Scholar
Essegaier, S. (1993). The rendezvous problem: a survey on a pure coordination game of imperfect information. LSE CDAM Research Report 61.Google Scholar
Gal, S. (1980). Search Games. Academic Press, New York.Google Scholar
Gal, S. (1999). Rendezvous search on the line. To appear in Operat. Res.Google Scholar
Howard, J. V. (1999). Rendezvous search on the interval and circle. To appear in Operat. Res. 47.Google Scholar
Lim, W. S. (1997). A rendezvous-evasion game on discrete locations with joint randomization. Adv. Appl. Prob., 29, 1004–1017.CrossRefGoogle Scholar
Lovasz, L. (1970). Unsolved problem II. In Combinatorial Structures and their Applications, ed. Guy, R. et al. Gordon and Breach, New York.Google Scholar
Ruckle, W. H. (1983). Pursuit on a cyclic graph. Internat. J. Game Theory 10, 91–99.Google Scholar
Tetali, P., and Winkler, P. (1993). Simultaneous Reversible Markov Chains. In Combinatorics, Paul Erdös is Eighty (Bolyai Society Mathematical Studies 1,) János Bolyai Mathematical Society, Budapest, pp. 433–451.Google Scholar