Network search games, with arbitrary searcher starting point
From MaRDI portal
Publication:3184600
DOI10.1002/net.20241zbMath1180.91056OpenAlexW4232037330MaRDI QIDQ3184600
Publication date: 21 October 2009
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20241
2-person games (91A05) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (22)
Hide-and-seek games on a tree to which Eulerian networks are attached ⋮ A competitive search game with a moving target ⋮ Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object ⋮ Integer programming models and algorithms for the graph decontamination problem with mobile agents ⋮ Search games on networks with travelling and search costs and with arbitrary searcher starting points ⋮ Patrolling a perimeter ⋮ Search and delivery man problems: when are depth-first paths optimal? ⋮ Search and rescue in the face of uncertain threats ⋮ A foraging problem: sit-and-wait versus active predation ⋮ On the approximation ratio of the random Chinese postman tour for network search ⋮ Search Games: A Review ⋮ Search Games for an Immobile Hider ⋮ Network search games with immobile hider, without a designated searcher starting point ⋮ Continuous patrolling and hiding games ⋮ The expanding search ratio of a graph ⋮ A new approach to Gal's theory of search games on weakly Eulerian networks ⋮ Searching symmetric networks with Utilitarian-Postman paths ⋮ Weighted network search games with multiple hidden objects and multiple search teams ⋮ Search for an immobile hider on a stochastic network ⋮ Search for an immobile hider in a known subset of a network ⋮ Search games on a network with travelling and search costs ⋮ Static search games played over graphs and general metric spaces
Cites Work
This page was built for publication: Network search games, with arbitrary searcher starting point
