Searching for multiple objects in multiple locations

DOI10.1016/j.ejor.2019.05.002zbMath1430.90308arXiv1710.05332OpenAlexW2963348104WikidataQ127906374 ScholiaQ127906374MaRDI QIDQ1999403

Kyle Y. Lin, Thomas F. Lidbetter

Publication date: 26 June 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.05332

zbMATH Keywords

game theorysearch gamesdiscrete optimization

Mathematics Subject Classification ID

Search theory (90B40) 2-person games (91A05) Applications of game theory (91A80)

Related Items (3)

A search game on a hypergraph with booby traps ⋮ Weighted network search games with multiple hidden objects and multiple search teams ⋮ Exact and heuristic approaches to detect failures in failed \(k\)-out-of-\(n\) systems

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal search for one of many objects hidden in two boxes
• Continuous and discrete search for one of many objects
• The theory of search games and rendezvous.
• Finding a hider by an unknown deadline
• Yet more on the linear search problem
• Chromatic polynomials and logarithmic concavity
• SEARCH GAMES: LITERATURE AND SURVEY
• Search Games with Multiple Hidden Objects
• Disperse or Unite? A Mathematical Model of Coordinated Attack
• Regret in Decision Making under Uncertainty
• The search for an intelligent evader concealed in one of an arbitrary number of regions
• Minimax Solutions for Linear Search Problems
• The search for an intelligent evader: Strategies for searcher and evader in the two-region problem
• The expanding search ratio of a graph
• A Periodic Optimal Search

This page was built for publication: Searching for multiple objects in multiple locations