1 citations · 1 across the 2 of their papers we have counts for
4 papers
A Classical Search Game in Discrete Locations
Jake Clarkson, Kyle Y. Lin, Kevin D. Glazebrook
Consider a two-person zero-sum search game between a hider and a searcher. The hider hides among discrete locations, and the searcher successively visits individual locations u…
Optimal Patrol of a Perimeter
Kyle Y Lin
A defender dispatches patrollers to circumambulate a perimeter to guard against potential attacks. The defender decides on the time points to dispatch patrollers and each patroller…
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…
Searching for Multiple Objects in Multiple Locations
Thomas Lidbetter, Kyle Lin
Many practical search problems concern the search for multiple hidden objects or agents, such as earthquake survivors. In such problems, knowing only the list of possible locations…