𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Search Theory || Search Games: A Review

✍ Scribed by Alpern, Steve; Fokkink, Robbert; Gąsieniec, Leszek; Lindelauf, Roy; Subrahmanian, V.S.


Book ID
120407455
Publisher
Springer New York
Year
2013
Tongue
English
Weight
254 KB
Edition
2013
Category
Article
ISBN
1461468256

No coin nor oath required. For personal study only.

✦ Synopsis


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.


📜 SIMILAR VOLUMES


Search Theory || Search Games: A Review
✍ Alpern, Steve; Fokkink, Robbert; Gąsieniec, Leszek; Lindelauf, Roy; Subrahmanian 📂 Article 📅 2013 🏛 Springer New York 🌐 English ⚖ 254 KB

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, mo

Search Theory || Tools to Manage Search
✍ Alpern, Steve; Fokkink, Robbert; Gąsieniec, Leszek; Lindelauf, Roy; Subrahmanian 📂 Article 📅 2013 🏛 Springer New York 🌐 English ⚖ 553 KB

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, mo

Weighted search games
✍ N. Zoroa; P. Zoroa; M.J. Fernández-Sáez 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 281 KB
A general search game
✍ Shmuel Gal 📂 Article 📅 1972 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 401 KB