The theory of search games and rendezvous

By S. Alpern, S. Gal. International Series in Operations Research and Management Science, 2002

622 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/ac114dc81a1d670a93ab3383d8a8f72e3badf9da

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Bruce L. Golden

In Computer Networks and Communications

1. James F. Campbell
2. Dimitrios M. Thilikos
3. Fedor V. Fomin
4. Bruce L. Golden
5. Niels A. H. Agatz
6. Erwin Pesch
7. Alena Otto

Citations in the corpus

• An annotated bibliography on guaranteed graph searching (2008, background): “Our classification is restricted to the classic line of guaranteed searching, initiated by Parsons and Petrov, where the searchers have to guarantee the capture without any probabilistic assumption on the game behavior.”
• Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey (2018, background): “Search problems have a long and rich history in the operations research (OR) literature, and we refer the interested reader to Koopman [135, 136], Stone [255], and Alpern and Gal [11] for essentials of search theory and to Benkoski et al.”
• Deterministic Rendezvous in Graphs (2003, background): “This task is known in the literature as the rendezvous problem in graphs [6], and in this paper we seek efficient deterministic algorithms to solve it.”