Research Catalog

Title

The theory of search games and rendezvous / by Steve Alpern, Shmuel Gal.

Author

Alpern, Steve, 1948-

Publication

Boston : Kluwer Academic Publishers, [2003], ©2003.

Items in the Library & Off-site

Holdings

Details

Additional Authors

Gal, Shemuʼel.

Description

xiv, 319 pages : illustrations; 24 cm.

Summary

• "Traditionally, the target of the search is assigned to have no motives of its own and is either stationary (e.g., oil, network problems, etc.) or its motion is determined stochastically by known rules (e.g., financial markets, scheduling, genetics, etc.). The theory of search games and rendezvous widens the dimensions to the classical problem with the addition of an independent player of equal status to the searcher, who cares about being found or not being found.
• These multiple motives of searcher and hider are analytically and mathematically considered the book's two foci: Search Games (Book I) and Rendezvous Theory (Book II)." "The book examines a whole variety of new configurations of theory and problems that arise from these two aspects of the analysis - resulting in a penetrating state-of-the-art treatment of this highly useful mathematical, analytical tool."--BOOK JACKET.

Series Statement

International series in operations research & management science ; 55

Uniform Title

International series in operations research & management science ; 55.

Subject

• Search theory
• Game theory

Bibliography (note)

• Includes bibliographical references (p. [303]-315) and index.

Contents

• 1. Introduction to Search Games -- Pt. 1. Search Games in Compact Spaces -- 2. General Framework -- 3. Search for an Immobile Hider -- 4. Search for a Mobile Hider -- 5. Miscellaneous Search Games -- Pt. 2. Search Games in Unbounded Domains -- 6. General Framework -- 7. On Minimax Properties of Geometric Trajectories -- 8. Search on the Infinite Line -- 9. Star and Plan Search -- 10. Introduction to Rendezvous Search -- 11. Elementary Results and Examples -- Pt. 3. Rendezvous Search on Compact Spaces -- 12. Rendezvous Values of a Compact Symmetric Region -- 13. Rendezvous on Labeled Networks -- 14. Asymmetric Rendezvous on an Unlabeled Circle -- 15. Rendezvous on a Graph -- Pt. 4. Rendezvous Search on Unbounded Domains -- 16. Asymmetric Rendezvous on the Line (ARPL) -- 17. Other Rendezvous Problems on the Line -- 18. Rendezvous in Higher Dimensions. App. A. A Minimax Theorem for Zero-Sum Games -- App. B. Theory of Alternating Search --
• App. C. Rendezvous-Evasion Problems.

ISBN

0792374681

LCCN

2002034126

OCLC

• ocm50669600
• SCSB-4329868

Owning Institutions

Columbia University Libraries