6 citations · 8 across the 18 of their papers we have counts for
4 papers · 1 filter
A Variation on Chip-Firing: the diffusion game
C. Duffy, T. F. Lidbetter, M. E. Messinger +1
We introduce a natural variant of the parallel chip-firing game, called the diffusion game. Chips are initially assigned to vertices of a graph. At every step, all vertices simulta…
Constant Factor Approximate Solutions for Expanding Search on General Networks
Steve Alpern, Thomas Lidbetter
We study the classical problem introduced by R. Isaacs and S. Gal of minimizing the time to find a hidden point on a network moving from a known starting point. Rather than…
On Submodular Search and Machine Scheduling
Robbert Fokkink, Thomas Lidbetter, László A. Végh
Suppose some objects are hidden in a finite set of hiding places which must be examined one-by-one. The cost of searching subsets of is given by a submodular function and t…
The expanding search ratio of a graph
Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter
We study the problem of searching for a hidden target in an environment that is modeled by an edge-weighted graph. A sequence of edges is chosen starting from a given root vertex s…