6 citations · 8 across the 18 of their papers we have counts for
Showing 2019 · math.OCShow all
3 papers · 2 filters
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
Competitive Search in a Network
Spyros Angelopoulos, Thomas Lidbetter
We study the classic problem in which a Searcher must locate a hidden point, also called the Hider in a network, starting from a root point. The network may be either bounded or un…
math.OC2019
A Search Game on a Hypergraph with Booby Traps
Thomas Lidbetter, Kyle Lin
A set of n boxes, located on the vertices of a hypergraph G, contain known but different rewards. A Searcher opens all the boxes in some hyperedge of G with the objective of collec…