Some remarks on cops and drunk robbers

The cops and robbers game has been extensively studied under the assumption of optimal play by both the cops and the robbers. In this paper we study the problem in which cops are chasing a drunk robber (that is, a robber who performs a random walk) on a graph. Our main goal is to characterize the "cost of drunkenness." Specif?ically, we study the ratio of expected capture times for the optimal version and the drunk robber one. We also examine the algorithmic side of the problem; that is, how to compute near-optimal search schedules for the cops. Finally, we present a preliminary investigation of the invisible robber game and point out diff?erences between this game and graph search.

[1]  Gary MacGillivray,et al.  A note on k-cop, l-robber games on graphs , 2006, Discret. Math..

[2]  Abbas Mehrabian.  The capture time of grids , 2011, Discret. Math..

[3]  Anthony Bonato,et al.  Pursuit-Evasion in Models of Complex Networks , 2007, Internet Math..

[4]  Dimitrios M. Thilikos,et al.  An annotated bibliography on guaranteed graph searching , 2008, Theor. Comput. Sci..

[5]  U. Rieder,et al.  Markov Decision Processes , 2010 .

[6]  Anthony Bonato,et al.  The Game of Cops and Robbers on Graphs , 2011 .

[7]  Peter Frankl,et al.  Cops and robbers in graphs with large girth and Cayley graphs , 1987, Discret. Appl. Math..

[8]  Béla Bollobás,et al.  Cops and robbers in a random graph , 2013, J. Comb. Theory, Ser. B.

[9]  Richard J. Nowakowski,et al.  A game of cops and robbers played on products of graphs , 1998, Discret. Math..

[10]  ANTHONY BONATO,et al.  NETWORK SECURITY IN MODELS OF COMPLEX NETWORKS , 2007 .

[11]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[12]  Tomasz Łuczak,et al.  Chasing robbers on random graphs: Zigzag theorem , 2010 .

[13]  M. Karonski.  Collisions among Random Walks on a Graph , 1993 .

[14]  Ronald A. Howard,et al.  Dynamic Programming and Markov Processes , 1960 .

[15]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[16]  Peter Winkler,et al.  Vertex-to-vertex pursuit in a graph , 1983, Discret. Math..

[17]  Pawel Pralat.  When does a random graph have constant cop number? , 2010, Australas. J Comb..

[18]  Martin Aigner,et al.  A game of cops and robbers , 1984, Discret. Appl. Math..

[19]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[20]  R. P. D. L. Barrière.  Optimal Control Theory , 1967 .

[21]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[22]  Tomasz Luczak,et al.  Chasing robbers on random graphs: Zigzag theorem , 2010, Random Struct. Algorithms.

[23]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[24]  Emanuel Todorov,et al.  Optimal Control Theory , 2006 .

[25]  L. A. Zadeh,et al.  Optimal Pursuit Strategies in Discrete-State Probabilistic Systems , 1962 .