For search games on general networks, the paper proves the deterministic expanding-search competitive ratio is achieved by a waterfilling strategy and gives constant-factor approximations to the randomized competitive ratio.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Competitive Search in a Network
For search games on general networks, the paper proves the deterministic expanding-search competitive ratio is achieved by a waterfilling strategy and gives constant-factor approximations to the randomized competitive ratio.