Advertisement

Search Theory

A Game Theoretic Perspective

  • Steve Alpern
  • Robbert Fokkink
  • Leszek Gąsieniec
  • Roy Lindelauf
  • V.S. Subrahmanian

Table of contents

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

    1. Front Matter
      Pages 1-1
    2. Shmuel Gal
      Pages 3-15
    3. Thomas Lidbetter
      Pages 17-27
    4. Noemí Zoroa, María-José Fernández-Sáez, Procopio Zoroa
      Pages 29-58
    5. Christos Pelekis, Moritz Schauer
      Pages 59-73
    6. Robbert Fokkink, Leonhard Geupel, Kensaku Kikuta
      Pages 75-81
  3. Geometric Games

    1. Front Matter
      Pages 83-83
    2. Vic Baston
      Pages 85-103
    3. Noemí Zoroa, María-José Fernández-Sáez, Procopio Zoroa
      Pages 105-118
    4. Jun Kiniwa, Kensaku Kikuta, Toshio Hamada
      Pages 119-133
    5. Vic Baston, Ian Woodward
      Pages 135-154
    6. Robbert Fokkink, Joram op den Kelder, Christos Pelekis
      Pages 155-163
  4. Rendezvous

    1. Front Matter
      Pages 165-165
    2. Leszek Gąsieniec
      Pages 167-174
    3. Gianlorenzo D’Angelo, Gabriele Di Stefano, Alfredo Navarra
      Pages 197-222
    4. Steve Alpern
      Pages 223-230
  5. Search in Biology

    1. Front Matter
      Pages 231-231

About this book

Introduction

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.

Keywords

Agent Based Modeling Predator Prey Systems Rendezvous Problem Robotics Search Games

Editors and affiliations

  • Steve Alpern
    • 1
  • Robbert Fokkink
    • 2
  • Leszek Gąsieniec
    • 3
  • Roy Lindelauf
    • 4
  • V.S. Subrahmanian
    • 5
  1. 1.University of WarwickWarwick Business SchoolCoventryUnited Kingdom
  2. 2., Institute of Applied MathematicsTechnical University DelftDelftNetherlands
  3. 3., Complexity Theory and Algorithmics GroupUniversity of LiverpoolLiverpoolUnited Kingdom
  4. 4., Section Military Operations ResearchNetherlands Defense AcademyBredaNetherlands
  5. 5., Computer Science DepartmentUniversity of MarylandCollege ParkUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4614-6825-7
  • Copyright Information Springer Science+Business Media New York 2013
  • Publisher Name Springer, New York, NY
  • eBook Packages Computer Science
  • Print ISBN 978-1-4614-6824-0
  • Online ISBN 978-1-4614-6825-7
  • Buy this book on publisher's site