Search Games with Multiple Hidden Objects

@article{Lidbetter2013SearchGW,
  title={Search Games with Multiple Hidden Objects},
  author={Tom Lidbetter},
  journal={SIAM J. Control and Optimization},
  year={2013},
  volume={51},
  pages={3056-3074}
}
We consider a class of zero-sum search games in which a Searcher seeks to minimize the expected time to find several objects hidden by a Hider. We begin by analyzing a game in which the Searcher wishes to find $k$ balls hidden among $n>k$ boxes. There is a known cost of searching each box, and the Searcher seeks to minimize the total expected cost of finding all the objects in the worst case. We show that it is optimal for the Searcher to begin by searching a $k$-subset $H$ of boxes with… CONTINUE READING

Similar Papers

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 17 CITATIONS

Search and Rescue in the Face of Uncertain Threats

  • ArXiv
  • 2019
VIEW 11 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

The search value of a set

VIEW 4 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Constant Factor Approximate Solutions for Expanding Search on General Networks

VIEW 18 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

The Expanding Search Ratio of a Graph

VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED