Search theory : a game theoretic perspective /

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, mod...

Full description

Saved in:
Bibliographic Details
Corporate Authors: SpringerLink (Online service)
Group Author: Alpern, Steve; Fokkink, Robbert; Gąsieniec, Leszek; Lindelauf, Roy; Subrahmanian, V. S.
Published: Springer,
Publisher Address: New York, NY :
Publication Dates: [2013]
Literature type: eBook
Language: English
Subjects:
Online Access: http://dx.doi.org/10.1007/978-1-4614-6825-7
Summary: 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.
Carrier Form: 1 online resource (viii, 303 pages) : illustrations
Bibliography: Includes bibliographical references.
ISBN: 9781461468257 (electronic book)
1461468256 (electronic book)
Index Number: T57
CLC: O229
Contents: Search Games.
Search Games: A Review /
Search Games for an Immobile Hider /
Tools to Manage Search Games on Lattices /
Network Coloring and Colored Coin Games /
Open Problems on Search Games /
Geometric Games.
Some Cinderella Ruckle Type Games /
The Cardinality of the Sets Involved in Lattice Games /
Effective Search for a Naval Mine with Application to Distributed Failure Detection /
The Value of the Two Cable Ambush Game /
How to Poison Your Mother-in-Law, and Other Caching Problems /
Rendezvous.
Rendezvous Problem /
Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty /
Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model /
Ten Open Problems in Rendezvous Search /
Search in Biology.
Interactions Between Searching Predators and Hidden Prey /
A Discrete Search-Ambush Game with a Silent Predator /
A Model of Partnership Formation with Friction and Multiple Criteria /
Applications of Search in Biology: Some Open Problems /