on-line algorithms, Proc. 22nd Annual ACM Sympo- sium on Theory of Computing ( STOC’1990), 369-378. [14] A. Dessmark, P. Fraigniaud, D. Kowalski, and A. Pelc, Deterministic rendezvous in graphs, Algorithmica 46 (2006), 69-96. [15] M. Dyer, A. Frieze, and R. Kannan, A random polyno- mial time algorithm for estimating volumes of convex bodies, Proc. 21st Annual ACM Symposium on Theory of Computing (STOC’1989), 375-381. [16] P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer, Gathering of asynchronous oblivious robots with lim- ited visibility, Proc. 18th Annual Symposium on The- oretical Aspects of Computer Science STACS’2001, LNCS 2010, 247-258. [17] S. Gal, Rendezvous search on the line, Operations Research 47 (1999), 974-976. [18] A. Israeli and M. Jalfon, Token management schemes and random walks yield self stabilizing mutual exclu- sion, Proc. PODC’1990, 119-131. [19] R. Klasing, A. Kosowski, A. Navarra, Taking advan- tage of symmetries: gathering of asynchronous oblivi- ous robots on a ring. Proc. 12th International Confer- ence on Principles of Distributed Systems, (OPODIS 2008), 446-462. [20] R. Klasing, E. Markou, A. Pelc, Gathering asyn- chronous oblivious mobile robots in a ring, Theoretical Computer Science 390 (2008), 27-39. [21] D. Kowalski, A. Malinowski, How to meet in anony- mous network. Theoretical Computer Science 399 (2008), 141-156. [22] E. Kranakis, D. Krizanc, N. Santoro and C. Sawchuk, Mobile agent rendezvous in a ring, Proc. 23rd Interna- tional Conference on Distributed Computing Systems (ICDCS’2003), 592-599. [23] W. Lim and S. Alpern, Minimax rendezvous on the line, SIAM J. on Control and Optimization 34 (1996), 1650-1665. [24] G. Prencipe, Impossibility of gathering by a set of au- tonomous mobile robots, Theoretical Computer Sci- ence 384 (2007), 222-231. [25] T. Schelling, The strategy of conflict, Oxford Univer- sity Press, Oxford, 1960. [26] G. Stachowiak, Asynchronous Deterministic Ren- dezvous on the Line, SOFSEM 2009: 497-508. [27] L. Thomas, Finding your kids when they are lost, Journal on Operational Res. Soc. 43 (1992), 637-639. [28] X. Yu and M. Yung, Agent rendezvous: a dynamic symmetry-breaking problem, Proc. International Col- loquium on Automata, Languages, and Programming (ICALP’1996), LNCS 1099, 610-621. [29] A. Ta-Shma, U. Zwick, Deterministic rendezvous, treasure hunts and strongly universal exploration se- quences., Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), 599-608.