Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

The theory of search games and rendezvous

Tools
- Tools
+ Tools

Alpern, S. and Gal, S. (2003) The theory of search games and rendezvous. International Series in Operations Research and Management Science, 55 . New York: Kluwer. ISBN 9780792374688

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Official URL: https://doi.org/10.1007/b100809

Request Changes to record.

Abstract

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.

Item Type: Book
Divisions: Faculty of Social Sciences > Warwick Business School > Operational Research & Management Sciences
Series Name: International Series in Operations Research and Management Science
Publisher: Kluwer
Place of Publication: New York
ISBN: 9780792374688
Editor: Alpern, S. and Gal, S.
Official Date: 2003
Dates:
DateEvent
2003Published
Volume: 55
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Description:

Series ISSN 0884-8289

Related URLs:
  • Other

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item
twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us