Skip to main content

Search Theory

A Game Theoretic Perspective

  • Book
  • © 2013

Overview

  • The first book focusing on search and rendezvous that will appeal to the computer science, mathematics and biology communities as well as non-experts
  • Most chapters include case studies or surveys
  • Includes a chapter on mobility in governed social networks
  • Includes supplementary material: sn.pub/extras

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (18 chapters)

  1. Search Games

  2. Geometric Games

  3. Rendezvous

  4. Search in Biology

Keywords

About this book

Search games and rendezvous problems have received growing attention in computer science within the past few years.  Rendezvous problems emerge naturally, for instance, to optimize performance and convergence of mobile robots. This gives a new algorithmic point of view to the theory. Furthermore, modern topics such as the spreading of gossip or disease in social networks have lead to new challenging problems in search and rendezvous.

Search Theory: A Game Theoretic Perspective introduces the first integrated approach to Search and Rendezvous from the perspectives of  biologists, computer scientists and mathematicians. This contributed volume covers a wide range of topics including rendezvous problems and solutions, rendezvous on graphs, search games on biology, mobility in governed social networks, search and security, and more.  Most chapters also include case studies or a  survey, in addition to a chapter on the future direction of Search and Rendezvous research.

This book targets researchers and practitioners working in computer science, mathematics and biology as a reference book.  Advanced level students focused on these fields will also find this book valuable as a secondary text book or reference.

Editors and Affiliations

  • University of Warwick, Warwick Business School, Coventry, United Kingdom

    Steve Alpern

  • , Institute of Applied Mathematics, Technical University Delft, Delft, Netherlands

    Robbert Fokkink

  • , Complexity Theory and Algorithmics Group, University of Liverpool, Liverpool, United Kingdom

    Leszek Gąsieniec

  • , Section Military Operations Research, Netherlands Defense Academy, Breda, Netherlands

    Roy Lindelauf

  • , Computer Science Department, University of Maryland, College Park, USA

    V.S. Subrahmanian

Bibliographic Information

Publish with us