Skip to main content
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 28
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Abramovskaya, Tatjana V. Fomin, Fedor V. Golovach, Petr A. and Pilipczuk, Michał 2016. How to hunt an invisible rabbit on a graph. European Journal of Combinatorics, Vol. 52, p. 12.

    Komarov, Natasha and Winkler, Peter 2016. Cop vs. Gambler. Discrete Mathematics, Vol. 339, Issue. 6, p. 1677.

    Noori, Narges Renzaglia, Alessandro Hook, Joshua Vander and Isler, Volkan 2016. Constrained Probabilistic Search for a One-Dimensional Random Walker. IEEE Transactions on Robotics, Vol. 32, Issue. 2, p. 261.

    Dereniowski, Dariusz Dyer, Danny Tifenbach, Ryan M. and Yang, Boting 2015. Zero-visibility cops and robber and the pathwidth of a graph. Journal of Combinatorial Optimization, Vol. 29, Issue. 3, p. 541.

    Ikeda, Yuki Fukai, Yasunari and Mizoguchi, Yoshihiro 2015. A property of random walks on a cycle graph. Pacific Journal of Mathematics for Industry, Vol. 7, Issue. 1,

    Wenk, Carl J. 2015. Control Sequencing in a Game of Identity Pursuit-Evasion. SIAM Journal on Control and Optimization, Vol. 53, Issue. 4, p. 1815.

    Basilico, Nicola Gatti, Nicola Monga, Mattia and Sicari, Sabrina 2014. Security Games for Node Localization through Verifiable Multilateration. IEEE Transactions on Dependable and Secure Computing, Vol. 11, Issue. 1, p. 72.

    Chen, Hua Kalyanam, Krishna Zhang, Wei and Casbeer, David 2014. 2014 American Control Conference. p. 5270.

    Renzaglia, Alessandro Noori, Narges and Isler, Volkan 2014. 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems. p. 4260.

    Alpern, Steve Fokkink, Robbert Gal, Shmuel and Timmer, Marco 2013. On Search Games That Include Ambush. SIAM Journal on Control and Optimization, Vol. 51, Issue. 6, p. 4544.

    Hsu, Chih-Cheng Chen, Yu-Yi Chou, Cheng-Fu and Golubchik, Leana 2013. On Design of Collaborative Mobile Sensor Networks for Deadline-Sensitive Mobile Target Detection. IEEE Sensors Journal, Vol. 13, Issue. 8, p. 2962.

    Basilico, Nicola Gatti, Nicola and Amigoni, Francesco 2012. Patrolling security games: Definition and algorithms for solving large instances with single patroller and single intruder. Artificial Intelligence, Vol. 184-185, p. 78.

    Chen, Yu-Yi Hsu, Chih-Cheng Chou, Cheng-Fu and Lin, Kate Ching-Ju 2012. 2012 IEEE Sensors. p. 1.

    Durham, Joseph W. Franchi, Antonio and Bullo, Francesco 2012. Distributed pursuit-evasion without mapping or global localization via local frontiers. Autonomous Robots, Vol. 32, Issue. 1, p. 81.

    Nijssen, Pim and Winands, Mark H. M. 2012. Monte Carlo Tree Search for the Hide-and-Seek Game Scotland Yard. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 4, Issue. 4, p. 282.

    Chung, Timothy H. Hollinger, Geoffrey A. and Isler, Volkan 2011. Search and pursuit-evasion in mobile robotics. Autonomous Robots, Vol. 31, Issue. 4, p. 299.

    Gal, Shmuel 2011. Wiley Encyclopedia of Operations Research and Management Science.

    Huang, Haomiao Zhang, Wei Ding, Jerry Stipanovic, Dusan M. and Tomlin, Claire J. 2011. IEEE Conference on Decision and Control and European Control Conference. p. 4835.

    Dumitrescu, Adrian Kok, Howi Suzuki, Ichiro and Żyliński, PaweŁ 2010. Vision-Based Pursuit-Evasion in a Grid. SIAM Journal on Discrete Mathematics, Vol. 24, Issue. 3, p. 1177.

    Durham, Joseph W Franchi, Antonio and Bullo, Francesco 2010. 2010 IEEE International Conference on Robotics and Automation. p. 3562.


Randomized Pursuit-Evasion in Graphs

  • DOI:
  • Published online: 01 May 2003

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 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 regard 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.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *