Skip to main content
  • Book
  • © 2013

Search Theory

A Game Theoretic Perspective

  • 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

Buy it now

Buying options

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

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

Table of contents (18 chapters)

  1. Front Matter

    Pages i-viii
  2. Search Games

    1. Front Matter

      Pages 1-1
    2. Search Games: A Review

      • Shmuel Gal
      Pages 3-15
    3. Search Games for an Immobile Hider

      • Thomas Lidbetter
      Pages 17-27
    4. Tools to Manage Search Games on Lattices

      • Noemí Zoroa, María-José Fernández-Sáez, Procopio Zoroa
      Pages 29-58
    5. Network Coloring and Colored Coin Games

      • Christos Pelekis, Moritz Schauer
      Pages 59-73
    6. Open Problems on Search Games

      • Robbert Fokkink, Leonhard Geupel, Kensaku Kikuta
      Pages 75-81
  3. Geometric Games

    1. Front Matter

      Pages 83-83
    2. Some Cinderella Ruckle Type Games

      • Vic Baston
      Pages 85-103
    3. The Cardinality of the Sets Involved in Lattice Games

      • Noemí Zoroa, María-José Fernández-Sáez, Procopio Zoroa
      Pages 105-118
    4. Effective Search for a Naval Mine with Application to Distributed Failure Detection

      • Jun Kiniwa, Kensaku Kikuta, Toshio Hamada
      Pages 119-133
    5. The Value of the Two Cable Ambush Game

      • Vic Baston, Ian Woodward
      Pages 135-154
    6. How to Poison Your Mother-in-Law, and Other Caching Problems

      • Robbert Fokkink, Joram op den Kelder, Christos Pelekis
      Pages 155-163
  4. Rendezvous

    1. Front Matter

      Pages 165-165
    2. Rendezvous Problem

      • Leszek Gąsieniec
      Pages 167-174
    3. Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model

      • Gianlorenzo D’Angelo, Gabriele Di Stefano, Alfredo Navarra
      Pages 197-222
    4. Ten Open Problems in Rendezvous Search

      • Steve Alpern
      Pages 223-230
  5. Search in Biology

    1. Front Matter

      Pages 231-231

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

Buy it now

Buying options

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