Search for an immobile hider in a known subset of a network
From MaRDI portal
Publication:2328862
DOI10.1016/J.TCS.2018.06.022zbMATH Open1435.91033OpenAlexW2808948282MaRDI QIDQ2328862FDOQ2328862
Authors: Steve Alpern 
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
Recommendations
- Network search games with immobile hider, without a designated searcher starting point
- Hide-and-seek games on a network, using combinatorial search paths
- The search value of a network
- A new approach to Gal's theory of search games on weakly Eulerian networks
- Search games with immobile hider
- Hide-and-seek games on a tree to which Eulerian networks are attached
- Search games on a broken wheel with traveling and search costs
- Approximate solutions for expanding search games on general networks
- Competitive search in a network
- Ambush Strategies in Search Games on Graphs
treenetworksearchzero-sum gameequal branch density distributionhider strategyimmobile hidersearcher strategysigned metric
Cites Work
- Title not available (Why is that?)
- The theory of search games and rendezvous.
- Find-and-fetch search on a tree
- Search Games with Mobile and Immobile Hider
- Search games
- Search games and other applications of game theory
- Network search games with immobile hider, without a designated searcher starting point
- Mining coal or finding terrorists: the expanding search paradigm
- Optimal trade-off between speed and acuity when searching for a small object
- Search Theory
- Online searching with turn cost
- The search game on a network with immobile hider
- Network search games, with arbitrary searcher starting point
- On the optimality of a simple strategy for searching graphs
- Search games with immobile hider
- Search games on trees with asymmetric travel times
- A new approach to Gal's theory of search games on weakly Eulerian networks
- Search games on a network with travelling and search costs
- Search games for an immobile hider
- Searching symmetric networks with Utilitarian-Postman paths
- Hide-and-seek games on a tree to which Eulerian networks are attached
- Title not available (Why is that?)
- Hide-and-seek games on a network, using combinatorial search paths
- Searching a variable speed network
- Search games with multiple hidden objects
- Search games: a review
- Tools to manage search games on lattices
Cited In (15)
- Search and rescue in the face of uncertain threats
- Searching a variable speed network
- A game of hide and seek in networks
- Search for an immobile hider on a stochastic network
- The search value of a network
- Searching symmetric networks with Utilitarian-Postman paths
- Search games on trees with asymmetric travel times
- Planning a multi-sensors search for a moving target considering traveling costs
- Network search games with immobile hider, without a designated searcher starting point
- Search for an immobile entity on a network
- Approximate solutions for expanding search games on general networks
- Complexity of searching an immobile hider in a graph
- Mining coal or finding terrorists: the expanding search paradigm
- Optimal trade-off between speed and acuity when searching for a small object
- Multi-objective search game: long-term vs short-term
This page was built for publication: Search for an immobile hider in a known subset of a network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2328862)
