Search for an immobile hider on a stochastic network
From MaRDI portal
Publication:2286995
Abstract: Harry hides on an edge of a graph and does not move from there. Sally, starting from a known origin, tries to find him as soon as she can. Harry's goal is to be found as late as possible. At any given time, each edge of the graph is either active or inactive, independently of the other edges, with a known probability of being active. This situation can be modeled as a zero-sum two-person stochastic game. We show that the game has a value and we provide upper and lower bounds for this value. Finally, by generalizing optimal strategies of the deterministic case, we provide more refined results for trees and Eulerian graphs.
Recommendations
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3173143 (Why is no real title available?)
- scientific article; zbMATH DE number 3436972 (Why is no real title available?)
- scientific article; zbMATH DE number 3204219 (Why is no real title available?)
- scientific article; zbMATH DE number 3277161 (Why is no real title available?)
- scientific article; zbMATH DE number 3078983 (Why is no real title available?)
- A Discrete Search Game
- A HIDE AND SEEK GAME WITH TRAVELING COST
- A Multistage Search Game
- A SEARCH GAME WITH TRAVELING COST
- A first course on zero-sum repeated games
- A general search game
- A hide–search game
- A search game on a cyclic graph
- A search game on the union of graphs with immobile hider
- Approximate solutions for expanding search games on general networks
- Complexity of searching an immobile hider in a graph
- Cops and robbers in a random graph
- Discrete Search with Directional Information
- Find-and-fetch search on a tree
- Hide-and-seek games on a network, using combinatorial search paths
- Hide-and-seek games on a tree to which Eulerian networks are attached
- Maker–Breaker percolation games I: crossing grids
- Mining coal or finding terrorists: the expanding search paradigm
- Network search games with immobile hider, without a designated searcher starting point
- Network search games, with arbitrary searcher starting point
- On a Discrete Search Problem on Three Arcs
- On the Optimality of the Exponential Functions for Some Minimax Problems
- On the optimality of a simple strategy for searching graphs
- Optimal trade-off between speed and acuity when searching for a small object
- Optimum Evasion Versus Systematic Search
- Paths in graphs
- Percolation
- Percolation
- Percolation games, probabilistic cellular automata, and the hard-core model
- Random graphs and complex networks. Volume 1
- Search Games with Mobile and Immobile Hider
- Search for an immobile entity on a network
- Search for an immobile hider in a known subset of a network
- Search games
- Search games on trees with asymmetric travel times
- Search games with immobile hider
- Search games: literature and survey
- Search-hide games on trees
- Searching a Tree with Permanently Noisy Advice
- Searching a variable speed network
- Searching symmetric networks with Utilitarian-Postman paths
- The gold-mine game
- The search for an intelligent evader concealed in one of an arbitrary number of regions
- The search for an intelligent evader: Strategies for searcher and evader in the two-region problem
- The search game on a network with immobile hider
- The theory of search games and rendezvous.
- Yet more on the linear search problem
Cited in
(13)- Possibility degree-based interval-valued \(q\)-rung orthopair fuzzy graphs
- Search games for an immobile hider
- A game of hide and seek in networks
- 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
- A Linear Programming Approach to the Search Game on a Network with Mobile Hider
- Search for a moving target in a competitive environment
- Complexity of searching an immobile hider in a graph
- A competitive search game with a moving target
- Multiple searchers searching for a randomly distributed immobile target on a unit network
- A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications
- Multi-objective search game: long-term vs short-term
This page was built for publication: Search for an immobile hider on a stochastic network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286995)
