A competitive search game with a moving target
From MaRDI portal
Publication:2158054
DOI10.1016/j.ejor.2022.03.004OpenAlexW4220924577MaRDI QIDQ2158054
Dries Vermeulen, Mathias Staudigl, Benoit Duvocelle, Janos Flesch
Publication date: 22 July 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.12032
game theoryoptimal strategiessearch gametwo-player zero-sum gamediscrete time-varying Markov process
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal search for moving targets
- A foraging problem: sit-and-wait versus active predation
- How to hunt an invisible rabbit on a graph
- Search for an immobile entity on a network
- Network search games with immobile hider, without a designated searcher starting point
- Subgame-perfect equilibria of finite- and infinite-horizon games
- Search-hide games on trees
- Borel determinacy
- Complexity of searching an immobile hider in a graph
- The gold-mine game
- Planning a multi-sensors search for a moving target considering traveling costs
- Subgame maxmin strategies in zero-sum stochastic games with tolerance levels
- Search and rescue in the face of uncertain threats
- Competitive search in a network
- Dynamic competition over social networks
- Search for an immobile hider on a stochastic network
- Correlated equilibria in stochastic games with Borel measurable payoffs
- Search games with immobile hider
- Yet more on the linear search problem
- A general search game
- Optimal Search for a Moving Target
- SEARCH GAMES: LITERATURE AND SURVEY
- Subgame-Perfect ϵ-Equilibria in Perfect Information Games with Common Preferences at the Limit
- Search Games: A Review
- Searching symmetric networks with Utilitarian-Postman paths
- Perfect-Information Games with Lower-Semicontinuous Payoffs
- Network search games, with arbitrary searcher starting point
- A Preemptive Detection Game
- Search for a Moving Target: The FAB Algorithm
- Optimal Search for a Moving Target in Discrete Time and Space
- A hide–search game
- The search for an intelligent evader concealed in one of an arbitrary number of regions
- Minimax Solutions for Linear Search Problems
- Technical Note—A Counterexample for an Optimal Search-and-Stop Model
- A Two-Cell Model of Search for a Moving Target
- On the Optimality of the Exponential Functions for Some Minimax Problems
- A SEQUENTIAL ALLOCATION GAME FOR TARGETS WITH VARYING VALUES
- The search for an intelligent evader: Strategies for searcher and evader in the two-region problem
- Search Games with Mobile and Immobile Hider
- A search game on a cyclic graph
- Discrete Search with Directional Information
- A search game with one object and two searchers
- A search game on the union of graphs with immobile hider
- Optimal search for a moving target with the option to wait
- Optimum Evasion Versus Systematic Search
- Game Theory
- A Simple Model of Search for a Moving Target
- Technical Note—Threshold Probabilities when Searching for a Moving Target
- A Multistage Search Game
- Optimal ambushing search for a moving target
This page was built for publication: A competitive search game with a moving target
