# Randomized Pursuit-Evasion in Graphs

```@article{Adler2003RandomizedPI,
title={Randomized Pursuit-Evasion in Graphs},
author={Micah Adler and Harald R{\"a}cke and Naveen Sivadasan and Christian Sohler and Berthold V{\"o}cking},
journal={Combinatorics, Probability and Computing},
year={2003},
volume={12},
pages={225 - 244}
}```
• Published 8 July 2002
• Computer Science, Mathematics, Biology
• Combinatorics, Probability and Computing
We analyse a randomized pursuit-evasion game played by two players on a graph, 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…
139 Citations

### A Study on a Game of Pursuit and Evasion on a Cycle Graph

• Computer Science, Mathematics
• 2015
The Hunter vs Rabbit game on graph is analyzed, a formalization of strategies using a random walk, theoretical estimation of bounds of a probability the rabbit caught, and computing simulation results are introduced.

### A property of random walks on a cycle graph

• Computer Science, Mathematics
• 2015
A formalization of strategies using a random walk, theoretical estimation of bounds of a probability that the hunter catches the rabbit, and computing simulation results are introduced.

### A property of randomwalks on a cycle graph

• Computer Science, Mathematics
• 2017
A formalization of strategies using a random walk, theoretical estimation of bounds of a probability that the hunter catches the rabbit, and computing simulation results are introduced that help choose the parameter β of a rabbit strategy according to the size N of the given graph.

### Randomized pursuit-evasion with limited visibility

• Computer Science
SODA '04
• 2004
It is shown that two hunters suffice for catching rabbits with limited visibility with high probability, and polynomial time algorithms are presented that decide whether a graph G is hunter-win, that is, if a single hunter can capture a rabbit of either kind on G.

### Multi-Step Multi-Sensor Hider-Seeker Games

• Computer Science
IJCAI
• 2009
An approximate best response oracle with bounded suboptimality for the seeker is developed, which proves performance bounds on the strategy that results when column/constraint generation with approximate best responses converges, and measures the performance of the algorithm in simulations.

### Monte Carlo Tree Search for the Hide-and-Seek Game Scotland Yard

• Economics
IEEE Transactions on Computational Intelligence and AI in Games
• 2012
This paper describes how Monte Carlo tree search (MCTS) can be applied to the hide-and-seek game Scotland Yard, and proposes a new technique, called location categorization, that biases the possible locations of the hider.

### Online problems and two-player games: algorithms and analysis

This thesis studies three problems that are adversarial in nature, and presents a probabilistic analysis of the well-known text book algorithm called the work function algorithm, which reveals that the performance of this algorithm is much better than worst-case for a large class of inputs.