000 04211nam a22006015i 4500
001 978-1-4614-6825-7
003 DE-He213
005 20200421112225.0
007 cr nn 008mamaa
008 130504s2013 xxu| s |||| 0|eng d
020 _a9781461468257
_9978-1-4614-6825-7
024 7 _a10.1007/978-1-4614-6825-7
_2doi
050 4 _aQA76.9.M35
072 7 _aUYAM
_2bicssc
072 7 _aUFM
_2bicssc
072 7 _aCOM018000
_2bisacsh
072 7 _aMAT003000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aSearch Theory
_h[electronic resource] :
_bA Game Theoretic Perspective /
_cedited by Steve Alpern, Robbert Fokkink, Leszek Gąsieniec, Roy Lindelauf, V.S. Subrahmanian.
264 1 _aNew York, NY :
_bSpringer New York :
_bImprint: Springer,
_c2013.
300 _aVIII, 303 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aComputer science
_xMathematics.
650 0 _aArtificial intelligence.
650 0 _aGame theory.
650 0 _aBiomathematics.
650 0 _aMathematics.
650 0 _aSocial sciences.
650 1 4 _aComputer Science.
650 2 4 _aMath Applications in Computer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aGame Theory, Economics, Social and Behav. Sciences.
650 2 4 _aMathematical and Computational Biology.
650 2 4 _aMathematics in the Humanities and Social Sciences.
700 1 _aAlpern, Steve.
_eeditor.
700 1 _aFokkink, Robbert.
_eeditor.
700 1 _aGąsieniec, Leszek.
_eeditor.
700 1 _aLindelauf, Roy.
_eeditor.
700 1 _aSubrahmanian, V.S.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781461468240
856 4 0 _uhttp://dx.doi.org/10.1007/978-1-4614-6825-7
912 _aZDB-2-SCS
942 _cEBK
999 _c57622
_d57622