2 citations · 4 across the 8 of their papers we have counts for
8 papers
Robust Patrol in a Dispersed Environment
Edward Mellor, Kevin Glazebrook, Kyle Lin +1
We consider a patrol problem in which a patroller moves among several geographically dispersed locations to detect attackers that arrive over time. Once the patroller arrives at a…
A Booby Trap Game
Thomas Lidbetter, Kyle Lin
This paper presents a booby trap game played between a defender and an attacker on a search space, which may be a compact subset of Euclidean space or a network. The defender has s…
Optimal Pure Strategies for a Discrete Search Game
Thuy Bui, Thomas Lidbetter, Kyle Y. Lin
Consider a two-person zero-sum search game between a Hider and a Searcher. The Hider chooses to hide in one of discrete locations (or "boxes") and the Searcher chooses a search…
Computing Optimal Strategies for a Search Game in Discrete Locations
Jake Clarkson, Kyle Y Lin
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…
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…