Search games: a review

DOI10.1007/978-1-4614-6825-7_1MaRDI QIDQ2961390zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 4125215
• Search games: literature and survey
• Search games for an immobile hider
• Dynamic Search Games
• scientific article; zbMATH DE number 1023202

Cites work

• scientific article; zbMATH DE number 4083352 (Why is no real title available?)
• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• scientific article; zbMATH DE number 3488946 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 464829 (Why is no real title available?)
• scientific article; zbMATH DE number 1951564 (Why is no real title available?)
• scientific article; zbMATH DE number 3204219 (Why is no real title available?)
• scientific article; zbMATH DE number 6297684 (Why is no real title available?)
• scientific article; zbMATH DE number 3405704 (Why is no real title available?)
• A Mixed-Strategy Minimax Theorem without Compactness
• A remark on the Princess and Monster search game
• Complexity of searching an immobile hider in a graph
• Dynamic programming and the smoothing problem
• Hide-and-seek games on a tree to which Eulerian networks are attached
• Isaacs' Princess and Monster Game on the circle
• Matching, Euler tours and the Chinese postman
• Minimax Solutions for Linear Search Problems
• More on the linear search problem
• Network search games with immobile hider, without a designated searcher starting point
• Network search games, with arbitrary searcher starting point
• On the Optimality of the Exponential Functions for Some Minimax Problems
• On the linear search problem
• On the optimality of a simple strategy for searching graphs
• On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
• Online searching with turn cost
• Optimal Constructions of Hybrid Algorithms
• Search Games with Mobile and Immobile Hider
• Search games
• Search in a Maze
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Searching in the plane
• Star search -- a different show
• Stochastic search in a convex region
• The linear search problem rides again
• The search game on a network with immobile hider
• The theory of search games and rendezvous.
• The ultimate strategy to search on \(m\) rays?
• The “Princess and Monster” Game on an Interval
• Yet more on the linear search problem

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
• scientific article; zbMATH DE number 4125215 (Why is no real title available?)
• 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)