1 option
Search Theory : A Game Theoretic Perspective / edited by Steve Alpern, Robbert Fokkink, Leszek Gąsieniec, Roy Lindelauf, V.S. Subrahmanian.
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Language:
- English
- Subjects (All):
- Computer science--Mathematics.
- Computer science.
- Artificial intelligence.
- Game theory.
- Biomathematics.
- Mathematics.
- Social sciences.
- Math Applications in Computer Science.
- Artificial Intelligence.
- Game Theory, Economics, Social and Behav. Sciences.
- Mathematical and Computational Biology.
- Mathematics in the Humanities and Social Sciences.
- Local Subjects:
- Math Applications in Computer Science.
- Artificial Intelligence.
- Game Theory, Economics, Social and Behav. Sciences.
- Mathematical and Computational Biology.
- Mathematics in the Humanities and Social Sciences.
- Physical Description:
- 1 online resource (VIII, 303 pages)
- Edition:
- First edition 2013.
- Contained In:
- Springer eBooks
- Place of Publication:
- New York, NY : Springer New York : Imprint: Springer, 2013.
- System Details:
- text file PDF
- 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.
- Contents:
- 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
- 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 Problem
- Deterministic Symmetric Rendezvous in Arbitrary Graphs
- Gathering asynchronous and oblivious robots on basic graph topologies
- Ten Open Problems in Rendezvous Search
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-1-4614-6825-7
- 9781461468257
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.