Minimax Solutions for Linear Search Problems

DOI10.1137/0127002MaRDI QIDQ4044396zbMATH OpenOpenAlexFDO

Authors Shmuel Gal

Publication date 1974

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0127002

Mathematics Subject Classification ID

Search theory (90B40) Noncooperative games (91A10)

Cited in

(24)

• Online algorithms for searching and exploration in the plane
• Lower bounds in on-line geometric searching metric searching
• Further connections between contract-scheduling and ray-searching problems
• A competitive search game with a moving target
• Weighted online search
• Online search with a hint
• Better upper bounds for searching on a line with Byzantine robots
• Two-agent tree evacuation
• Multi-processor search and scheduling problems with setup cost
• Competitive search in a network
• Star search -- a different show
• A general search game
• Search for an immobile entity on a network
• Online searching with turn cost
• Best-of-both-worlds analysis of online search
• Infinite linear programming and online searching with turn cost
• Lower bounds in on-line geometric searching
• scientific article; zbMATH DE number 7559116 (Why is no real title available?)
• Multi-target ray searching problems
• Search games: a review
• The expanding search ratio of a graph
• Wireless evacuation on \(m\) rays with \(k\) searchers
• Online routing and searching on graphs with blocked edges
• Searching for multiple objects in multiple locations

This page was built for publication: Minimax Solutions for Linear Search Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044396)