The theory of search games and rendezvous /

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 consid...

Full description

Bibliographic Details
Main Author:	Alpern, Steve, 1948-
Corporate Author:	SpringerLink (Online service)
Other Authors:	Gal, Shmuel (Mathematician)
Format:	eBook
Language:	English
Published:	Boston : Kluwer Academic Publishers, [2003]
Series:	International series in operations research & management science ; 55.
Subjects:	Search theory. Game theory. Economic Theory. Calculus of Variations and Optimal Control. Optimization. Probability Theory and Stochastic Processes. Game Theory, Economics, Social and Behav. Sciences. Operations Research/Decision Theory. Décision, Théorie de la. Jeux, Théorie des. SCIENCE > System Theory. TECHNOLOGY & ENGINEERING > Operations Research. Electronic books.
Online Access:	Connect to the full text of this electronic book Connect to the full text of this electronic book

Table of Contents:

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