Cargando…
Lectures in game theory for computer scientists /
Games provide mathematical models for interaction. Numerous tasks in computer science can be formulated in game-theoretic terms. This fresh and intuitive way of thinking through complex issues reveals underlying algorithmic questions and clarifies the relationships between different domains. This co...
| Clasificación: | Libro Electrónico |
|---|---|
| Otros Autores: | , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cambridge ; New York :
Cambridge University Press,
©2011.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000Ia 4500 | ||
|---|---|---|---|
| 001 | EBSCO_ocn721938038 | ||
| 003 | OCoLC | ||
| 005 | 20231017213018.0 | ||
| 006 | m o d | ||
| 007 | cr mnu---unuuu | ||
| 008 | 110510s2011 enka ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d CDX |d E7B |d OSU |d OCLCQ |d UKMGB |d UIU |d REDDC |d OCLCQ |d OCLCF |d YDXCP |d OCLCQ |d LLB |d OCLCQ |d IUL |d UAB |d OCLCQ |d OL$ |d OCLCQ |d K6U |d UKAHL |d OCLCO |d OCLCQ |d OCLCO | ||
| 016 | 7 | |a 015649243 |2 Uk | |
| 020 | |a 9781139010276 |q (electronic bk.) | ||
| 020 | |a 1139010271 |q (electronic bk.) | ||
| 020 | |a 9780511973468 |q (electronic bk.) | ||
| 020 | |a 0511973462 |q (electronic bk.) | ||
| 020 | |z 9780521198660 |q (hbk.) | ||
| 020 | |z 0521198666 |q (hbk.) | ||
| 029 | 1 | |a AU@ |b 000062594503 | |
| 035 | |a (OCoLC)721938038 | ||
| 050 | 4 | |a QA269 |b .L33 2011eb | |
| 072 | 7 | |a COM |x 052000 |2 bisacsh | |
| 072 | 7 | |a COM |x 037000 |2 bisacsh | |
| 072 | 7 | |a COM |x 013000 |2 bisacsh | |
| 072 | 7 | |a COM |x 032000 |2 bisacsh | |
| 072 | 7 | |a COM |x 018000 |2 bisacsh | |
| 072 | 7 | |a COM |x 014000 |2 bisacsh | |
| 072 | 7 | |a COM |x 067000 |2 bisacsh | |
| 082 | 0 | 4 | |a 004.015193 |2 22 |
| 049 | |a UAMI | ||
| 245 | 0 | 0 | |a Lectures in game theory for computer scientists / |c edited by Krzysztof R. Apt and Erich Grädel. |
| 260 | |a Cambridge ; |a New York : |b Cambridge University Press, |c ©2011. | ||
| 300 | |a 1 online resource (xii, 295 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 504 | |a Includes bibliographical references and index. | ||
| 588 | 0 | |a Print version record. | |
| 520 | |a Games provide mathematical models for interaction. Numerous tasks in computer science can be formulated in game-theoretic terms. This fresh and intuitive way of thinking through complex issues reveals underlying algorithmic questions and clarifies the relationships between different domains. This collection of lectures, by specialists in the field, provides an excellent introduction to various aspects of game theory relevant for applications in computer science that concern program design, synthesis, verification, testing and design of multi-agent or distributed systems. Originally devised for a Spring School organised by the GAMES Networking Programme in 2009, these lectures have since been revised and expanded, and range from tutorials concerning fundamental notions and methods to more advanced presentations of current research topics. This volume is a valuable guide to current research on game-based methods in computer science for undergraduate and graduate students. It will also interest researchers working in mathematical logic, computer science and game theory. | ||
| 505 | 0 | 0 | |g Machine generated contents note: |g 1. |t A Primer on Strategic Games / |r Krzysztof R. Apt -- |g 1.1. |t Introduction -- |g 1.2. |t Basic concepts -- |g 1.3. |t Iterated elimination of strategies I -- |g 1.4. |t Mixed extension -- |g 1.5. |t Iterated elimination of strategies II -- |g 1.6. |t Variations on the definition of strategic games -- |g 1.7. |t Mechanism design -- |g 1.8. |t Pre-Bayesian games -- |g 1.9. |t Conclusions -- |g 2. |t Infinite Games and Automata Theory / |r Christof Loding -- |g 2.1. |t Introduction -- |g 2.2. |t Basic notations and definitions -- |g 2.3. |t Transformation of winning conditions -- |g 2.4. |t Tree automata -- |g 2.5. |t Beyond finite automata -- |g 2.6. |t Conclusion -- |g 3. |t Algorithms for Solving Parity Games / |r Marcin Jurdzinski -- |g 3.1. |t Games on graphs -- |g 3.2. |t Solving repeated reachability and eventual safety games. |
| 505 | 0 | 0 | |g 3.3. |t Solving parity games -- |g 3.4. |t Related work -- |g 4. |t Back and Forth Between Logic and Games / |r Erich Gradel -- |g 4.1. |t Introduction -- |g 4.2. |t Reachability games and parity games -- |g 4.3. |t Reachability games and logic -- |g 4.4. |t Logics with least and greatest fixed-points -- |g 4.5. |t Definability of winning regions in parity games -- |g 4.6. |t Inflationary fixed-point logic and backtracking games -- |g 4.7. |t Logic and games in a quantitative setting -- |g 5. |t Turn-Based Stochastic Games / |r Antonin Kucera -- |g 5.1. |t Introduction -- |g 5.2. |t Winning objectives in stochastic games -- |g 5.3. |t Reachability objectives in games with finitely and infinitely many vertices -- |g 5.4. |t Some directions of future research -- |g 6. |t Games with Imperfect Information: Theory and Algorithms / |r Jean-Francois Raskin -- |g 6.1. |t Introduction -- |g 6.2. |t Games with perfect information. |
| 505 | 0 | 0 | |g 6.3. |t Games with imperfect information: surely-winning -- |g 6.4. |t Games with imperfect information: almost-surely-winning -- |g 7. |t Graph Searching Games / |r Stephan Kreuizer -- |g 7.1. |t Introduction -- |g 7.2. |t Classifying graph searching games -- |g 7.3. |t Variants of graph searching games -- |g 7.4. |t Monotonicity of graph searching -- |g 7.5. |t Obstructions -- |g 7.6. |t An application to graph-decompositions -- |g 7.7. |t Complexity of graph searching -- |g 7.8. |t Conclusion -- |g 8. |t Beyond Nash Equilibrium: Solution Concepts for the 21st Century / |r Joseph Y. Halpern -- |g 8.1. |t Introduction -- |g 8.2. |t Robust and resilient equilibrium -- |g 8.3. |t Taking computation into account -- |g 8.4. |t Taking (lack of) awareness into account -- |g 8.5. |t Iterated regret minimisation -- |g 8.6. |t Conclusions. |
| 590 | |a eBooks on EBSCOhost |b EBSCO eBook Subscription Academic Collection - Worldwide | ||
| 650 | 0 | |a Game theory. | |
| 650 | 0 | |a Computer science |x Mathematics. | |
| 650 | 6 | |a Théorie des jeux. | |
| 650 | 6 | |a Informatique |x Mathématiques. | |
| 650 | 7 | |a COMPUTERS |x Reference. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Machine Theory. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Computer Literacy. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Information Technology. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Data Processing. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Computer Science. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Hardware |x General. |2 bisacsh | |
| 650 | 7 | |a Computer science |x Mathematics |2 fast | |
| 650 | 7 | |a Game theory |2 fast | |
| 700 | 1 | |a Apt, Krzysztof R., |d 1949- | |
| 700 | 1 | |a Grädel, Erich, |d 1958- | |
| 776 | 0 | 8 | |i Print version: |t Lectures in game theory for computer scientists. |d Cambridge : Cambridge University Press, ©2011 |z 9780521198660 |w (OCoLC)664324519 |
| 856 | 4 | 0 | |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=357388 |z Texto completo |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH13438415 | ||
| 938 | |a Coutts Information Services |b COUT |n 17892411 | ||
| 938 | |a ebrary |b EBRY |n ebr10469073 | ||
| 938 | |a EBSCOhost |b EBSC |n 357388 | ||
| 938 | |a YBP Library Services |b YANK |n 6137397 | ||
| 938 | |a YBP Library Services |b YANK |n 6300857 | ||
| 938 | |a YBP Library Services |b YANK |n 6943926 | ||
| 938 | |a YBP Library Services |b YANK |n 5049338 | ||
| 994 | |a 92 |b IZTAP | ||