Rendezvous search on a graph

Journal of Applied Probability

Volumn 36, Issue 1, 1999, Pages 223-231

  Alpern, Steve ^a   Baston, V J ^b   Essegaier, Skander ^c  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^c Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

Rendezvous search; Search game

Indexed keywords

EID: 0033238292     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0021900200016983     Document Type: Article

References (13)

1. 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.
2. ALPERN, S. (1995). The rendezvous search problem. SIAM J. Control Optim. 33, 673-683.
3. ALSPACH, B. (1981). The search for long paths and cycles in vertex-transitive graphs and digraphs. In Combinatorial Mathematics VIII, ed. K. L. McAvaney. (Lecture Notes in Math. 884). Springer, Berlin, pp. 14-22.
4. ANDERSON, E. J. AND WEBER, R. R. (1990). The rendezvous problem on discrete locations. J. Appl. Prob. 28, 839-851.
5. BECK, A. (1964). On the linear search problem. Israel J. Math. 2, 221-228.
6. ESSEGAIER, S. (1993). The rendezvous problem: a survey on a pure coordination game of imperfect information. LSE CDAM Research Report 61.
7. GAL, S. (1980). Search Games. Academic Press, New York.
8. GAL, S. (1999). Rendezvous search on the line. To appear in Operat. Res.
9. HOWARD, J. V. (1999). Rendezvous search on the interval and circle. To appear in Operat. Res. 47.
10. LIM, W. S. (1997). A rendezvous-evasion game on discrete locations with joint randomization. Adv. Appl. Prob., 29, 1004-1017.
11. LOVASZ, L. (1970). Unsolved problem II. In Combinatorial Structures and their Applications, ed. R. Guy et al. Gordon and Breach, New York.
12. RUCKLE, W. H. (1983). Pursuit on a cyclic graph. Internat. J. Game Theory 10, 91-99.
13. TETALI, P. AND WINKLER, P. (1993). Simultaneous Reversible Markov Chains. In Combinatories, Paul Erdös is Eighty (Bolyai Society Mathematical Studies 1,) János Bolyai Mathematical Society, Budapest, pp. 433-451.