Search Games with Multiple Hidden Objects
From MaRDI portal
Publication:2862458
DOI10.1137/120893938zbMath1276.90031OpenAlexW2045358652MaRDI QIDQ2862458
Publication date: 15 November 2013
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: http://eprints.lse.ac.uk/55103/
Search theory (90B40) 2-person games (91A05) Stochastic network models in operations research (90B15) Dynamic games (91A25)
Related Items (18)
Game-based modeling of independent searchers who share a common goal ⋮ A search game on a hypergraph with booby traps ⋮ Search and delivery man problems: when are depth-first paths optimal? ⋮ Search and rescue in the face of uncertain threats ⋮ The search and rescue game on a cycle ⋮ On Submodular Search and Machine Scheduling ⋮ Optimal linear tracking for a hidden target on one of \(K\)-intervals ⋮ The search value of a set ⋮ Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games ⋮ Continuous patrolling and hiding games ⋮ The expanding search ratio of a graph ⋮ Searching for multiple objects in multiple locations ⋮ Weighted network search games with multiple hidden objects and multiple search teams ⋮ Approximate solutions for expanding search games on general networks ⋮ Search for an immobile hider in a known subset of a network ⋮ Exact and heuristic approaches to detect failures in failed \(k\)-out-of-\(n\) systems ⋮ Control Sequencing in a Game of Identity Pursuit-Evasion ⋮ A game theoretic approach to a problem in polymatroid maximization
This page was built for publication: Search Games with Multiple Hidden Objects
