International Series in Operations Research & Management Science

The Theory of Search Games and Rendezvous

Authors: Alpern, Steve, Gal, Shmuel

Free Preview

Buy this book

eBook $139.00
price for USA in USD (gross)
  • ISBN 978-0-306-48212-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $179.99
price for USA in USD
  • ISBN 978-0-7923-7468-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $179.99
price for USA in USD
  • ISBN 978-1-4419-4908-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Table of contents (18 chapters)

Table of contents (18 chapters)

Buy this book

eBook $139.00
price for USA in USD (gross)
  • ISBN 978-0-306-48212-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $179.99
price for USA in USD
  • ISBN 978-0-7923-7468-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $179.99
price for USA in USD
  • ISBN 978-1-4419-4908-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Services for this Book

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
The Theory of Search Games and Rendezvous
Authors
Series Title
International Series in Operations Research & Management Science
Series Volume
55
Copyright
2003
Publisher
Springer US
Copyright Holder
Springer Science+Business Media New York
eBook ISBN
978-0-306-48212-0
DOI
10.1007/b100809
Hardcover ISBN
978-0-7923-7468-8
Softcover ISBN
978-1-4419-4908-0
Series ISSN
0884-8289
Edition Number
1
Number of Pages
XV, 319
Topics