Overview

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 in the book's two foci: Search Games (Book I) and Rendezvous Theory (Book II). Shmuel Gal's work on Search Games (Gal, 1980) stimulated considerable research in a variety of fields including Computer Science, Engineering, Biology, and Economics. Steve Alpern's original formulation of the rendezvous search problem in 1976 and his formalization of the continuous version (Alpern, 1995) have led to much research in rendezvous theory in the past few years. New material is covered in both 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.

Full Product Details

Author:   Steve Alpern ,  Shmuel Gal
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   Softcover reprint of the original 1st ed. 2003
Volume:   55
Dimensions:   Width: 15.50cm , Height: 1.70cm , Length: 23.50cm
Weight:   0.522kg
ISBN:  

9781441949080

ISBN 10:   1441949089
Pages:   319
Publication Date:   08 December 2010
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions