Search Games: A Review
From MaRDI portal
Publication:2961390
DOI10.1007/978-1-4614-6825-7_1zbMath1356.91026OpenAlexW136782164MaRDI QIDQ2961390
Publication date: 20 February 2017
Published in: Search Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-6825-7_1
Search theory (90B40) 2-person games (91A05) Games involving graphs (91A43) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Other game-theoretic models (91A40) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (8)
A competitive search game with a moving target ⋮ Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs ⋮ Impact of knowledge on the cost of treasure hunt in trees ⋮ A search problem on a bipartite network ⋮ Weighted network search games with multiple hidden objects and multiple search teams ⋮ Search for a moving target in a competitive environment ⋮ Search for an immobile hider in a known subset of a network ⋮ Search games on a network with travelling and search costs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Searching in the plane
- Network search games with immobile hider, without a designated searcher starting point
- The linear search problem rides again
- Search games
- A remark on the Princess and Monster search game
- Star search -- a different show
- 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.
- Stochastic search in a convex region
- On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
- Online searching with turn cost
- On the linear search problem
- More on the linear search problem
- Yet more on the linear search problem
- Dynamic Programming and the Smoothing Problem
- Network search games, with arbitrary searcher starting point
- Hide-and-seek games on a tree to which Eulerian networks are attached
- The search game on a network with immobile hider
- Search in a Maze
- The “Princess and Monster” Game on an Interval
- A Mixed-Strategy Minimax Theorem without Compactness
- Minimax Solutions for Linear Search Problems
- On the Optimality of the Exponential Functions for Some Minimax Problems
- Search Games with Mobile and Immobile Hider
- Optimal Constructions of Hybrid Algorithms
- Matching, Euler tours and the Chinese postman
- The ultimate strategy to search on \(m\) rays?
- Isaacs' Princess and Monster Game on the circle
This page was built for publication: Search Games: A Review
