Cargando…

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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Alpern, Steve (Editor ), Fokkink, Robbert (Editor ), Gąsieniec, Leszek (Editor ), Lindelauf, Roy (Editor ), Subrahmanian, V.S (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York, NY : Springer New York : Imprint: Springer, 2013.
Edición:1st ed. 2013.
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-1-4614-6825-7
003 DE-He213
005 20220114162105.0
007 cr nn 008mamaa
008 130504s2013 xxu| s |||| 0|eng d
020 |a 9781461468257  |9 978-1-4614-6825-7 
024 7 |a 10.1007/978-1-4614-6825-7  |2 doi 
050 4 |a QA76.9.M35 
072 7 |a UYA  |2 bicssc 
072 7 |a COM018000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Search Theory  |h [electronic resource] :  |b A Game Theoretic Perspective /  |c edited by Steve Alpern, Robbert Fokkink, Leszek Gąsieniec, Roy Lindelauf, V.S. Subrahmanian. 
250 |a 1st ed. 2013. 
264 1 |a New York, NY :  |b Springer New York :  |b Imprint: Springer,  |c 2013. 
300 |a VIII, 303 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
505 0 |a 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. 
520 |a 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. 
650 0 |a Computer science-Mathematics. 
650 0 |a Artificial intelligence. 
650 0 |a Game theory. 
650 0 |a Biomathematics. 
650 0 |a Mathematics. 
650 0 |a Social sciences. 
650 1 4 |a Mathematical Applications in Computer Science. 
650 2 4 |a Artificial Intelligence. 
650 2 4 |a Game Theory. 
650 2 4 |a Mathematical and Computational Biology. 
650 2 4 |a Mathematics in the Humanities and Social Sciences. 
700 1 |a Alpern, Steve.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Fokkink, Robbert.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Gąsieniec, Leszek.  |e editor.  |0 (orcid)0000-0003-1809-9814  |1 https://orcid.org/0000-0003-1809-9814  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Lindelauf, Roy.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Subrahmanian, V.S.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9781461468264 
776 0 8 |i Printed edition:  |z 9781493900671 
776 0 8 |i Printed edition:  |z 9781461468240 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-1-4614-6825-7  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)