Ten Open Problems in Rendezvous Search - Search Theory: A Game Theoretic Perspective - page 218

5. Alpern, S. Rendezvous search: a personal perspective. Operations Research 2002; 50

(5):772-795.

6. Alpern, S. Rendezvous search on labelled networks. Naval Research Logistics 2002;

49 :256-274.
7. Alpern, S. Rendezvous search with revealed information: applications to the line. Journal of
Applied Probability 2007; 44 (1):1-15.
8. Alpern, S. Line-of-sight rendezvous. European Journal of Operational Research 2008; 188
(3): 865-883.
9. Alpern, S. Rendezvous Search Games, Wiley Encyclopedia of Operations Research and Man-
agement Science 2012, John Wiley & Sons, Inc.
10. Alpern, S, and Beck, A. Asymmetric rendezvous on the line is a double linear search problem.
Mathematics of Operations Research 1999; 24 (3): 604-618.
11. Alpern, S and Gal, S. Rendezvous search on the line with distinguishable players. SIAM J.
Control & Optimization 1995; 33 :1270-1276.
12. Alpern, S and Gal, S. Search Games and Rendezvous Theory, Springer, 2003.
13. Alpern, S and Howard, JV. Alternating search at two locations. Dynamics and Control 2000;
10 :319-339.
14. Alpern, S and Lim, WS. Rendezvous of three agents on the line. Naval Research Logistics
2002; 49 :244-255. (6):2233-2252.
15. Anderson, EJ and Essegaier, S. Rendezvous search on the line with indistinguishable players,
SIAM Journal of Control and Optimization 1995; 33 :1637-1642.
16. Anderson, EJ. and Weber, R. The rendezvous problem on discrete locations. Journal of Ap-
pliedProbability 1990; 27 :839-851.
17. Baston, VJ. Two rendezvous search problems on the line, Naval Research Logistics 1999;
46: 335-340.
18. Benkoski, S, Monticino, M and Weisinger, J. . A survey of the search theory literature. Naval
Research Logistics 1991; 38 :469-494.
19. Chester, EJ and Tutuncu, RH. Rendezvous search on the labelled line Operations Research
2004; 52 (2):330-334. Operations Research 1999; 47 (6):849-861.
20. Dessmark, A, Fraigniaud, P, Kowalski, D and Pelc, A. Deterministic rendezvous in graphs.
Algorithmica 2006; 46 :69-96.
21. Dobrev,S, Flocchini,P, Prencipe,G and Santoro, N. Multiple agents rendezvous in a ring in
spite of a black hole. Lecture Notes in Computer Science 2004: Volume 3144/2004, 34-46
22. Howard, JV. Rendezvous search on the interval and circle. Operations Research 1999; 47
(4):550-558.
23. Kikuta, K and Ruckle, W. Rendezvous search on a star graph with examination costs. Euro-
pean Journal of Operational Research 2007; 181 (1):298-304.
24. Kowalski, D. and Malinoski, A. How to meet in anonymous network. Theoretical Computer
Science 2008; 399 :141-156.
25. Kranakis, E, Krizanc, D and Rajsbaum, S. Mobile agent rendezvous: a survey. Lecture Notes
in Computer Science 2006, Volume 4056/2006, Springer Berlin / Heidelberg.
26. Lim, WS and Alpern, S. Minimax rendezvous search on the line. SIAM J. Control Optim.
1996; 34 :1650-1665.
27. Lim, WS, Alpern, S and Beck, A. Rendezvous search on the line with more than two players.
Operations Research 1997; 45 (3):357-364.
28. Lin, J Morse, AS and Anderson, BDO. The Multi-Agent Rendezvous Problem. Part 1: The
synchronous Case. SIAM J. Control Optim 2007; 46 (6):2096-2119.
29. Lin, J, Morse, AS and Anderson, BDO. The Multi-Agent Rendezvous Problem. Part 2: The
asynchronous Case. SIAM J. Control Optim 2007; 46 (6):2120-2147.

30. Marco,G, Gargano, Kranakis,E, Krizanc,D and Pelc, A. Asynchronous deterministic ren-

dezvous in graphs. Theoretical Computer Science 2006; 355 :315-326.

31. Qiaoming H, Du, D, Vera,J and Zuluaga, LF. Improved Bounds for the Symmetric Rendezvous

Value on the Line Operations Research 2008; 56 (3):772-782.

32. Schelling, T. The Strategy of Conflict. Harvard University Press, Cambridge, 1960.