Search games: a review
DOI10.1007/978-1-4614-6825-7_1zbMATH Open1356.91026OpenAlexW136782164MaRDI QIDQ2961390FDOQ2961390
Authors: Shmuel Gal 
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
Recommendations
Search theory (90B40) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) 2-person games (91A05) Other game-theoretic models (91A40) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matching, Euler tours and the Chinese postman
- Searching in the plane
- The theory of search games and rendezvous.
- Search Games with Mobile and Immobile Hider
- Title not available (Why is that?)
- Search games
- Network search games with immobile hider, without a designated searcher starting point
- On the Optimality of the Exponential Functions for Some Minimax Problems
- Title not available (Why is that?)
- The ultimate strategy to search on \(m\) rays?
- Star search -- a different show
- On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
- Online searching with turn cost
- On the linear search problem
- Yet more on the linear search problem
- Minimax Solutions for Linear Search Problems
- Optimal Constructions of Hybrid Algorithms
- Title not available (Why is that?)
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Stochastic search in a convex region
- The search game on a network with immobile hider
- Dynamic programming and the smoothing problem
- Network search games, with arbitrary searcher starting point
- The linear search problem rides again
- More on the linear search problem
- On the optimality of a simple strategy for searching graphs
- A Mixed-Strategy Minimax Theorem without Compactness
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity of searching an immobile hider in a graph
- Hide-and-seek games on a tree to which Eulerian networks are attached
- Title not available (Why is that?)
- Title not available (Why is that?)
- A remark on the Princess and Monster search game
- The “Princess and Monster” Game on an Interval
- Search in a Maze
- Isaacs' Princess and Monster Game on the circle
Cited In (14)
- Shortest closed curve to contain a sphere in its convex hull
- A search problem on a bipartite network
- Search for an immobile hider in a known subset of a network
- Search games on a network with travelling and search costs
- Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs
- Weighted network search games with multiple hidden objects and multiple search teams
- Search games: literature and survey
- COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS
- Search for a moving target in a competitive environment
- A competitive search game with a moving target
- Impact of knowledge on the cost of treasure hunt in trees
- Open problems on search games
- Title not available (Why is that?)
- COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS
This page was built for publication: Search games: a review
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961390)
