English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider a search problem in which one or more targets must be rescued bya search party, or Searcher. The targets may be survivors of some naturaldisaster, or prisoners held by an adversary. The targets are hidden among afinite set of locations, but when a location is searched, there is a knownprobability that the search will come to an end, perhaps because the Searcherbecomes trapped herself, or is captured by the adversary. If this happensbefore all the targets have been recovered, then the rescue attempt is deemed afailure. The objective is to find the search that maximizes the probability ofrecovering all the targets. We present and solve a game theoretic model forthis problem, by placing it in a more general framework that encompassesanother game previously introduced by the author. We also consider an extensionto the game in which the targets are hidden on the vertices of a graph. In thecase that there is only one target, we give a solution of the game played on atree.

Search and Rescue in the Face of Uncertain Threats