4 papers
On Extensions of the Unanimous Vote Problem
Evan J. R. Brody, Haya Diwan, Lisa Hellerstein +1
The Unanimous Vote problem is to determine a fixed order in which to flip each of biased coins, where each coin can be flipped only once, such that the expected number of flips…
A review of minimum cost box searching games
Thomas Lidbetter
We consider a class of zero-sum search games in which a Hider hides one or more target among a set of boxes. The boxes may require differing amount of time to search, and detec…
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…
Search Games with Predictions
Spyros Angelopoulos, Thomas Lidbetter, Konstantinos Panagiotou
We introduce the study of search games between a mobile Searcher and an immobile Hider in a new setting in which the Searcher has some potentially erroneous information, i.e., a pr…