1 citations · 1 across the 3 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2019
Search and Delivery Man Problems: When Are Depth-First Paths Optimal?
Steve Alpern, Thomas Lidbetter
Let h be a probability measure on the nodes and arcs of a network Q, viewed either as the location of a hidden object to be found or as the continuous distribution of customers rec…
math.OC2019
The Uniformed Patroller Game
Steve Alpern, Stamatios Katsikas
In the recently introduced network patrolling game, an Attacker carries out an attack on a node of her choice, for a given number m of consecutive periods. The parameter m indicate…
math.OC2017★ 1 cited
Periodic Patrols on the Line and Other Networks
Steve Alpern, Thomas Lidbetter, Katerina Papadaki
We consider a patrolling game on a graph recently introduced by Alpern et al. (2011) where the Patroller wins if he is at the attacked node while the attack is taking place. This p…