LEADER 03697nam  2200565Ia 450 
001 9910741168703321
005 20200520144314.0
010   $a1-4614-6825-6
024 7 $a10.1007/978-1-4614-6825-7
035   $a(CKB)3280000000007698
035   $a(OCoLC)842837783
035   $a(CaPaEBR)ebrary10700115
035   $a(SSID)ssj0000897427
035   $a(PQKBManifestationID)11490311
035   $a(PQKBTitleCode)TC0000897427
035   $a(PQKBWorkID)10904248
035   $a(PQKB)11212457
035   $a(DE-He213)978-1-4614-6825-7
035   $a(MiAaPQ)EBC1697103
035   $a(PPN)170487938
035   $a(EXLCZ)993280000000007698
100   $a20130523d2013      uy         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 00$aSearch theory $ea game theoretic perspective /$fSteve Alpern ... [et al.], editors
205   $a1st ed. 2013.
210   $aNew York $cSpringer$dc2013
215   $a1 online resource (299 p.) 
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a1-4939-0067-6 
311   $a1-4614-6824-8 
320   $aIncludes bibliographical references.
327   $aSearch 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.
330   $aSearch 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.
606   $aSearch theory
606   $aGame theory
615  0$aSearch theory.
615  0$aGame theory.
676   $a519.3
701   $aAlpern$b Steve$0145016
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910741168703321
996   $aSearch theory$94189587
997   $aUNINA