Search for an immobile hider on a stochastic network
From MaRDI portal
Publication:2286995
DOI10.1016/j.ejor.2019.11.040zbMath1431.91062arXiv1904.12852OpenAlexW2991159027WikidataQ126663049 ScholiaQ126663049MaRDI QIDQ2286995
Marco Scarsini, Tristan Garrec
Publication date: 23 January 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.12852
Random graphs (graph-theoretic aspects) (05C80) Search theory (90B40) 2-person games (91A05) Games involving graphs (91A43) Stochastic games, stochastic differential games (91A15) Positional games (pursuit and evasion, etc.) (91A24)
Related Items
A competitive search game with a moving target, Planning a multi-sensors search for a moving target considering traveling costs, Search for a moving target in a competitive environment, A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications, Possibility degree-based interval-valued \(q\)-rung orthopair fuzzy graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Search for an immobile entity on a network
- Network search games with immobile hider, without a designated searcher starting point
- Search-hide games on trees
- Search games
- Complexity of searching an immobile hider in a graph
- On the optimality of a simple strategy for searching graphs
- The theory of search games and rendezvous.
- The gold-mine game
- Cops and robbers in a random graph
- Percolation games, probabilistic cellular automata, and the hard-core model
- Approximate solutions for expanding search games on general networks
- Search for an immobile hider in a known subset of a network
- Search games with immobile hider
- Yet more on the linear search problem
- A general search game
- SEARCH GAMES: LITERATURE AND SURVEY
- Random Graphs and Complex Networks
- Find-and-Fetch Search on a Tree
- 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
- On a Discrete Search Problem on Three Arcs
- The search game on a network with immobile hider
- Percolation
- A HIDE AND SEEK GAME WITH TRAVELING COST
- A hide–search game
- The search for an intelligent evader concealed in one of an arbitrary number of regions
- A SEARCH GAME WITH TRAVELING COST
- A Discrete Search Game
- On the Optimality of the Exponential Functions for Some Minimax Problems
- The search for an intelligent evader: Strategies for searcher and evader in the two-region problem
- Search Games with Mobile and Immobile Hider
- Percolation
- Hide-and-Seek Games on a Network, Using Combinatorial Search Paths
- A search game on a cyclic graph
- Discrete Search with Directional Information
- Paths in graphs
- A search game on the union of graphs with immobile hider
- Maker–Breaker percolation games I: crossing grids
- Searching a Tree with Permanently Noisy Advice
- Searching a Variable Speed Network
- Mining Coal or Finding Terrorists: The Expanding Search Paradigm
- Optimum Evasion Versus Systematic Search
- A Multistage Search Game
- A first course on zero-sum repeated games
