Theoretical Computer Science
The complexity of searching a graph
Journal of the ACM (JACM)
Searching for a mobile intruder in a polygonal region
SIAM Journal on Computing
Recontamination does not help to search a graph
Journal of the ACM (JACM)
Randomized algorithms
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems
Journal of the ACM (JACM)
Sweeping simple polygons with a chain of guards
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Random walks, universal traversal sequences, and the complexity of maze problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Pursuit-evasion with imprecise target location
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed algorithm engineering
Experimental algorithmics
Randomized pursuit-evasion with limited visibility
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
How to meet in anonymous network
Theoretical Computer Science
The role of information in the cop-robber game
Theoretical Computer Science
Adaptive Kanerva-based function approximation for multi-agent systems
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Adaptive Fuzzy Function Approximation for Multi-agent Reinforcement Learning
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
A double oracle algorithm for zero-sum security games on graphs
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
How to meet in anonymous network
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
A decentralized solution for locating mobile agents
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Capture bounds for visibility-based pursuit evasion
Proceedings of the twenty-ninth annual symposium on Computational geometry
Hi-index | 0.00 |
We analyze a randomized pursuit-evasion game on graphs. This game is played by two players, a hunter and a 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 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 unrestricted, i.e., it can jump to an arbitrary node in every round. We say that the rabbit is 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 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 驴(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.