Some remarks on cops and drunk robbers

Details Some remarks on cops and drunk robbers Some remarks on cops and drunk robbers

2011-06-13

arxiv.org/abs/1106.2414v1

Computer Science

Discrete Mathematics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Some remarks on cops and drunk robbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some remarks on cops and drunk robbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some remarks on cops and drunk robbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-429366