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

Full description

Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Alpern, Steve. (Editor), Fokkink, Robbert. (Editor), Gsieniec, Leszek. (Editor), Lindelauf, Roy. (Editor), Subrahmanian, V.S. (Editor)
Format: Electronic
Language:English
Published: New York, NY : Springer New York : Imprint: Springer, 2013.
Subjects:
Online Access:https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-1-4614-6825-7
Table of 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.