Rendezvous search: A personal perspective

Operations Research

Volumn 50, Issue 5, 2002, Pages

  Alpern, Steve ^a  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

Author keywords

Games group decisions: teams.; Search and surveillance: rendezvous search

Indexed keywords

OPERATIONS RESEARCH; PROBABILITY DISTRIBUTIONS; THEOREM PROVING;

RENDEZVOUS-SEARCH PROBLEM;

PROBLEM SOLVING;

EID: 0036758708     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.50.5.772.363     Document Type: Review

References (56)

1. Alpern, S. 1995. The rendezvous search problem. SIAM J. Control Optim. 33 673-683. (Earlier published as LSE CDAM Research Report, 1993. Vol. 53, London School of Economics, London, U.K.).
2. _. 2000. Asymmetric rendezvous search on the circle. Dynam. Control 10 33-45.
3. _. 2001. Rendezvous in one or more dimensions. LSE Mathematics Preprint Series, LSE-CDAM-2001-05. London School of Economics, London, U.K.
4. _. 2002. Rendezvous search on labelled networks. Naval Res. Logist. 49 256-274.
5. _, A. Beck. 1997. Rendezvous search on the line with bounded resources: Expected time minimization. Eur. J. Oper. Res. 101 588-597.
6. _, _. 1999a. Asymmetric rendezvous on the line is a double linear search problem. Math. Oper. Res. 24(3) 604-618.
7. _, _. 1999b. Rendezvous search on the line with bounded resources: Maximizing the probability of meeting. Oper. Res. 47(6) 849-861.
8. _, _. 2000. Pure strategy asymmetric rendezvous on the line with an unknown initial distance. Oper. Res. 48(3) 1-4.
9. _, _. 2002. Rendezvous search on the line with limited resources: Meeting probability maximization for concave distributions. In preparation.
10. _, S. Gal. 1995. Rendezvous search on the line with distinguishable players. SIAM J. Control Optim. 33 1270-1276.
11. _, _. 2002a. Search for an agent who may or may not want to be found. Oper. Res. 50(2) 311-323.
12. _, _. 2002b. Recent Trends in Search Games and Rendezvous Theory. International Series in Operations Research and Management Science. Kluwer, Norwell, MA.
13. _, J.V. Howard. 2000. Alternating search at two locations. Dynam. Control 10 319-339.
14. _, W.S. Lim. 1998. The symmetric rendezvous-evasion game. SIAM J. Control Optim. 36(3) 948-959.
15. _, _. 2002. Rendezvous of three agents on the line. Naval Res. Logist. 49 244-255.
16. _, M. Pikounis. 2000. The telephone coordination game. Game Theory Appl. 5 1-10.
17. _, D.J. Reyniers. 1994. The rendezvous and coordinated search problems. Proc. IEEE, 33rd CDC, No. 1, 513-517.
18. _, B. Baston, S. Essegaier. 1999. Rendezvous search on a graph. J. Appl. Probab. 36(1) 223-231.
19. Anderson, E.J., S. Essegaier, 1995. Rendezvous search on the line with indistinguishable players. SIAM J. Control Optim. 33 1637-1642.
20. _, S. Fekete. 2001. Two-dimensional rendezvous search. Oper. Res. 49 107-188.
21. _, R.R. Weber. 1990. The rendezvous problem on discrete locations. J. Appl. Probab. 28 839-851.
22. Baston, V.J. 1999. Two rendezvous search problems on the line. Naval Res. Logist. 46 335-340.
23. _, S. Gal. 1998. Rendezvous on the line when the players' initial distance is given by an unknown probability distribution. SIAM J. Control Optim. 36(6) 1880-1889.
24. Chester, E.J., R.H. Tutuncu. 2002. Rendezvous search on finite domains. Oper. Res. (to appear).
25. Di Cairano, C. 1999. Asymmetric rendezvous search on the line. Ph.D. dissertation, Faculty of Mathematical Studies, University of Southampton, U.K.
26. Essegaier, S. 1993. The rendezvous problem: A survey on a pure coordination game of imperfect information. LSE CDAM Research Report, Vol. 61. London School of Economics, London, U.K.
27. Gal, S. 1999. Rendezvous search on the line. Oper. Res. 47 974-976.
28. Howard, J.V. 1999. Rendezvous search on the interval and circle. Oper. Res. 47(4) 550-558.
29. Lim, W.S. 1996. Rendezvous-evasion as a multi-stage game with observed actions. LSE-CDAM-96-05. London School of Economics, London, U.K.
30. _. 1997. A rendezvous-evasion game on discrete locations with joint randomization. Adv. Appl. Probab. 29 1004-1017.
31. _, S. Alpern. 1996. Minimax rendezvous search on the line. SIAM J. Control Optim. 34 1650-1665.
32. _, _, A. Beck. 1997. Rendezvous search on the line with more than two players. Oper. Res. 45(3) 357-364.
33. Matthews, R. 1995. How to find your children when they are lost. Sunday Telegraph. Science page, March 26.
34. Pikounis, M. 1997. Rendezvous search simulation. Project Report, Department of Computer Science, University of Edinburgh, Scotland.
35. _, L.C. Thomas. 1998. Many player rendezvous search: Stick together or split and meet? Preprint. Management School, University of Edinburgh, Scotland.
36. Thomas, L.C., P.B. Hulme. 1997. Searching for targets who want to be found. J. Oper. Res. Soc. 48(1) 44-50.
37. Aleniunas, R., R.M. Karp, R.J. Lipton, L. Lovasz, C. Rackoff. 1979. Random walks, universal traversal sequences, and the complexity of maze problems. 20th Annual Symposium on Foundations of Computer Science. San Juan, Puerto Rico, 218-223.
38. Alspach, B. 1981. The Search for Long Paths and Cycles in Vertex-Transitive Graphs and Digraphs. K.L. McAveney, ed. Combinatorial Mathematics VIII, Lecture Notes #884, Springer, Berlin, 14-22.
39. Baston, V.J.D., F.A. Bostock. 1991. A basic searchlight game. J. Optim. Theory Appl. 71 47-66.
40. Beck, Anatole. 1964. On the linear search problem. Israel J. Math. 2 221-228.
41. Bellman, R. 1963. An optimal search problem. SIAM Rev. 5 274.
42. Benkoski, S., M. Monticino, J. Weisinger. 1991. A survey of the search theory literature. Naval Res. Logist. 38 469-494.
43. Crawford, V.P., H. Haller. 1990. Learning how to cooperate: Optimal play in repeated coordination games. Econometrica 58(3) 571-596.
44. Foley, R.D., T.P. Hill, M.C. Spruill. 1991. Linear search with bounded resources. Naval Res. Logist. 38 555-565.
45. Gal, S. 1980. Search Games. Academic Press, New York.
46. Isaacs, R. 1965. Differential Games. John Wiley, New York.
47. Kramarz, F. 1996. Dynamic focal points in N-person coordination games. Theory and Decision 40 277-313.
48. Lovasz, L. 1970. Unsolved problem II in combinatorial structures and their applications. Proc. Calgary Internat. Conf. on Combinatorial Structures and Their Appl. 1969.R. Guy et al., eds. Gordon and Breach, New York.
49. McNab, A. 1994. Bravo Two Zero. Corgi Books, London,U.K.
50. Ponssard, J.-P. 1994. Formalisation des connaissances, apprentisage organisationnel et rationalité interactive (Chapitre 7). A. Orléan ed. Analyse Economiques des Conventions. P.U.F., Paris, France.
51. Ruckle, W.H. 1983a. Geometric Games and Their Applications. Pitman, Boston, MA.
52. _. 1983b. Pursuit on a cyclic graph. Internat. J. Game Theory 10 91-99.
53. Schelling, T. 1960. The Strategy of Conflict. Harvard University Press, Cambridge, MA.
54. Stone, L.D. 1989. Theory of Optimal Search, 2nd ed. Operations Research Society of America, Arlington, VA.
55. Sugden, R.A. 1995. Theory of focal points. Econom. J. 105 533-550.
56. Tetali, P., P. Winkler. 1993. Simultaneous reversible Markov chains. Bolyai Soc. Math. Stud. Combinatorics. Paul Erdos Is Eighty 1 433-451.