The Theory of Search Games and Rendezvous

• Main Authors: Alpern, Steve. (Author), Gal, Shmuel. (Author)
• Corporate Author: SpringerLink (Online service)
• Format: Electronic
• Language: English
• Published: Boston, MA : Springer US, 2003.
• Series: International Series in Operations Research & Management Science, 55
• Subjects: Mathematics.; Operations research.; Decision making.; Game theory.; Calculus of variations.; Probabilities.; Economic theory.; Calculus of Variations and Optimal Control; Optimization.; Game Theory, Economics, Social and Behav. Sciences.; Economic Theory/Quantitative Economics/Mathematical Methods.; Probability Theory and Stochastic Processes.; Operation Research/Decision Theory.
• Online Access: View fulltext via EzAccess

Search Theory is one of the original disciplines within the field of Operations Research. It deals with the problem faced by a Searcher who wishes to minimize the time required to find a hidden object, or ỚStarget. Ớ<U+00fd> The Searcher chooses a path in the ỚSsearch spaceỚ<U+00fd&...

Table of Contents:

• Search Games
• to Search Games
• Search Games in Compact Spaces
• General Framework
• Search for an Immobile Hider
• Search for a Mobile Hider
• Miscellaneous Search Games
• Search Games in Unbounded Domains
• General Framework
• On Minimax Properties of Geometric Trajectories
• Search on the Infinite Line
• Star and Plan Search
• Rendezvous Search
• to Rendezvous Search
• Elementary Results and Examples
• Rendezvous Search on Compact Spaces
• Rendezvous Values of a Compact Symmetric Region
• Rendezvous on Labeled Networks
• Asymmetric Rendezvous on an Unlabeled Circle
• Rendezvous on a Graph
• Rendezvous Search on Unbounded Domains
• Asymmetric Rendezvous on the Line (ARPL)
• Other Rendezvous Problems on the Line
• Rendezvous in Higher Dimensions.