Search for an immobile hider in a known subset of a network
From MaRDI portal
Publication:2328862
DOI10.1016/j.tcs.2018.06.022zbMath1435.91033OpenAlexW2808948282MaRDI QIDQ2328862
Publication date: 16 October 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/103274/13/WRAP-search-immobile-Hider-known-network-Alpern-2018.pdf
networktreezero-sum gamesearchequal branch density distributionhider strategyimmobile hidersearcher strategysigned metric
Related Items
Search and rescue in the face of uncertain threats ⋮ Planning a multi-sensors search for a moving target considering traveling costs ⋮ Search for an immobile hider on a stochastic network
Cites Work
- Unnamed Item
- Unnamed Item
- A new approach to Gal's theory of search games on weakly Eulerian networks
- Network search games with immobile hider, without a designated searcher starting point
- Search games
- On the optimality of a simple strategy for searching graphs
- The theory of search games and rendezvous.
- Search games and other applications of game theory
- Search games on a network with travelling and search costs
- Search games with immobile hider
- Online searching with turn cost
- Search Games with Multiple Hidden Objects
- Find-and-Fetch Search on a Tree
- Search Games: A Review
- Search Games for an Immobile Hider
- Tools to Manage Search Games on Lattices
- Searching symmetric networks with Utilitarian-Postman paths
- Search Games on Trees with Asymmetric Travel Times
- Network search games, with arbitrary searcher starting point
- Hide-and-seek games on a tree to which Eulerian networks are attached
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object
- The search game on a network with immobile hider
- Search Games with Mobile and Immobile Hider
- Hide-and-Seek Games on a Network, Using Combinatorial Search Paths
- Search Theory
- Searching a Variable Speed Network
- Mining Coal or Finding Terrorists: The Expanding Search Paradigm
