Deutsch

Benutzerhandbuch Datenschutzhinweis Impressum Kontakt

# Datensatz

Randomized Pursuit-Evasion in Graphs

Adler, M., Räcke, H., Sivadasan, N., Sohler, C., & Vöcking, B. (2002). Randomized Pursuit-Evasion in Graphs. In Automata, Languages and Programming: 29th International Colloquium, ICALP 2002 (pp. 901-912). Berlin, Germany: Springer.

Item is

### Basisdaten

einblenden: ausblenden:
Genre: Konferenzbeitrag

### Dateien

einblenden: Dateien

einblenden:

### Urheber

einblenden:
ausblenden:
Urheber:
Räcke, Harald, Autor
Sohler, Christian, Autor
Vöcking, Berthold1, Autor
Widmayer, Peter, Herausgeber
Triguero, Francisco, Herausgeber
Morales, Rafael, Herausgeber
Hennessy, Matthew, Herausgeber
Eidenbenz, Stephan, Herausgeber
Conejo, Ricardo, Herausgeber
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

### Inhalt

einblenden:
ausblenden:
Schlagwörter: -
Zusammenfassung: { We analyze a randomized pursuit-evasion game on graphs. This game is played by two players, a {\em hunter} and a {\em rabbit}. Let $G$ be any connected, undirected graph with $n$ nodes. The game is played in rounds and in each round both the hunter and the rabbit are located at a node of the graph. Between rounds both the hunter and the rabbit can stay at the current node or move to another node. The hunter is assumed to be {\em restricted} to the graph $G$: in every round, the hunter can move using at most one edge. For the rabbit we investigate two models: in one model the rabbit is restricted to the same graph as the hunter, and in the other model the rabbit is {\em unrestricted}, i.e., it can jump to an arbitrary node in every round. We say that the rabbit is {\em caught}\/ as soon as hunter and rabbit are located at the same node in a round. The goal of the hunter is to catch the rabbit in as few rounds as possible, whereas the rabbit aims to maximize the number of rounds until it is caught. Given a randomized hunter strategy for $G$, the {\em escape length} for that strategy is the worst case expected number of rounds it takes the hunter to catch the rabbit, where the worst case is with regards to all (possibly randomized) rabbit strategies. Our main result is a hunter strategy for general graphs with an escape length of only $\O(n \log (\diam(G)))$ against restricted as well as unrestricted rabbits. This bound is close to optimal since $\Omega(n)$ is a trivial lower bound on the escape length in both models. Furthermore, we prove that our upper bound is optimal up to constant factors against unrestricted rabbits. }

### Details

einblenden:
ausblenden:
Sprache(n): eng - Englisch
Datum: 2003-08-262002
Publikationsstatus: Im Druck publiziert
Seiten: -
Ort, Verlag, Ausgabe: -
Inhaltsverzeichnis: -
Art der Begutachtung: -
Identifikatoren: eDoc: 202057
Anderer: Local-ID: C1256428004B93B8-07C33A9C6FA1B038C1256D13002D8771-NSBV+02
Art des Abschluß: -

### Veranstaltung

einblenden:
ausblenden:
Titel: ICALP 2002
Veranstaltungsort: Málaga, Spain
Start-/Enddatum: 2002-07-08 - 2002-07-13

einblenden:

einblenden:

### Quelle 1

einblenden:
ausblenden:
Titel: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002
Genre der Quelle: Konferenzband
Urheber:
Affiliations:
Ort, Verlag, Ausgabe: Berlin, Germany : Springer
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 901 - 912 Identifikator: ISBN: 3-540-43864-5

### Quelle 2

einblenden:
ausblenden:
Titel: Lecture Notes in Computer Science
Genre der Quelle: Reihe
Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 2380 Artikelnummer: - Start- / Endseite: - Identifikator: -