Advertisement

The Theory of Search Games and Rendezvous

  • Steve Alpern
  • Shmuel Gal

Part of the International Series in Operations Research & Management Science book series (ISOR, volume 55)

Table of contents

  1. Front Matter
    Pages i-xv
  2. Search Games

    1. Front Matter
      Pages 1-1
  3. Search Games in Compact Spaces

    1. Front Matter
      Pages 7-7
    2. Pages 9-12
  4. Search Games in Unbounded Domains

    1. Front Matter
      Pages 99-99
    2. Pages 101-105
    3. Pages 145-162
  5. Rendezvous Search

    1. Front Matter
      Pages 163-163
  6. Rendezvous Search on Compact Spaces

  7. Rendezvous Search on Unbounded Domains

  8. Back Matter
    Pages 291-319

About this book

Introduction

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 “target. ” The Searcher chooses a path in the “search space” and finds the target when he is sufficiently close to it. Traditionally, the target is assumed to have no motives of its own regarding when it is found; it is simply stationary and hidden according to a known distribution (e. g. , oil), or its motion is determined stochastically by known rules (e. g. , a fox in a forest). The problems dealt with in this book assume, on the contrary, that the “target” is an independent player of equal status to the Searcher, who cares about when he is found. We consider two possible motives of the target, and divide the book accordingly. Book I considers the zero-sum game that results when the target (here called the Hider) does not want to be found. Such problems have been called Search Games (with the “ze- sum” qualifier understood). Book II considers the opposite motive of the target, namely, that he wants to be found. In this case the Searcher and the Hider can be thought of as a team of agents (simply called Player I and Player II) with identical aims, and the coordination problem they jointly face is called the Rendezvous Search Problem.

Keywords

Finite Mathematica economics graph theorem

Authors and affiliations

  • Steve Alpern
    • 1
  • Shmuel Gal
    • 2
  1. 1.London School of EconomicsUK
  2. 2.University of HaifaIsrael

Bibliographic information

  • DOI https://doi.org/10.1007/b100809
  • Copyright Information Kluwer Academic Publishers 2003
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-0-7923-7468-8
  • Online ISBN 978-0-306-48212-0
  • Series Print ISSN 0884-8289
  • Buy this book on publisher's site