The search for an intelligent evader concealed in one of an arbitrary number of regions

DOI10.1002/nav.3800260410zbMath0498.90046OpenAlexW1513794304MaRDI QIDQ3964311

David M. Roberts, J. C. Gittins

Publication date: 1979

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800260410

zbMATH Keywords

approximationsoptimal strategiestwo-person zero-sum gamearbitrary number of regionsintelligent evadersearch for an evader

Mathematics Subject Classification ID

Search theory (90B40) 2-person games (91A05)

Related Items (6)

A competitive search game with a moving target ⋮ Unnamed Item ⋮ Searching for multiple objects in multiple locations ⋮ Finding a hider by an unknown deadline ⋮ Weighted network search games with multiple hidden objects and multiple search teams ⋮ Search for an immobile hider on a stochastic network

Cites Work

• The search for an intelligent evader: Strategies for searcher and evader in the two-region problem
• Optimal resource allocation in chemical research

This page was built for publication: The search for an intelligent evader concealed in one of an arbitrary number of regions