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...
Gespeichert in:
| Weitere Verfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge ; New York :
Cambridge University Press,
©2011.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | 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. |
| Beschreibung: | 1 online resource (xii, 295 pages) : illustrations |
| Bibliographie: | Includes bibliographical references and index. |
| ISBN: | 9781139010276 1139010271 9780511973468 0511973462 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn721938038 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.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 |d OCLCL |d OCLCQ |d OCLCL |d SFB |d OCLCQ | ||
| 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.) | ||
| 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 | 7 | |a 004.015193 |2 22 | |
| 049 | |a MAIN | ||
| 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. |
| 650 | 0 | |a Game theory. |0 http://id.loc.gov/authorities/subjects/sh85052941 | |
| 650 | 0 | |a Computer science |x Mathematics. |0 http://id.loc.gov/authorities/subjects/sh85042295 | |
| 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 | |
| 655 | 0 | |a Electronic books. | |
| 655 | 4 | |a Electronic books. | |
| 700 | 1 | |a Apt, Krzysztof R., |d 1949- |1 https://id.oclc.org/worldcat/entity/E39PBJrGyD69pW3yyQF8CdbmVC |0 http://id.loc.gov/authorities/names/n77005986 | |
| 700 | 1 | |a Grädel, Erich, |d 1958- |1 https://id.oclc.org/worldcat/entity/E39PBJgd9K8rypyQ6QFH6GcdcP |0 http://id.loc.gov/authorities/names/n96097127 | |
| 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 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=357388 |3 Volltext |
| 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 GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn721938038 |
|---|---|
| _version_ | 1816881758628478976 |
| adam_text | |
| any_adam_object | |
| author2 | Apt, Krzysztof R., 1949- Grädel, Erich, 1958- |
| author2_role | |
| author2_variant | k r a kr kra e g eg |
| author_GND | http://id.loc.gov/authorities/names/n77005986 http://id.loc.gov/authorities/names/n96097127 |
| author_additional | Krzysztof R. Apt -- Christof Loding -- Marcin Jurdzinski -- Erich Gradel -- Antonin Kucera -- Jean-Francois Raskin -- Stephan Kreuizer -- Joseph Y. Halpern -- |
| author_facet | Apt, Krzysztof R., 1949- Grädel, Erich, 1958- |
| author_sort | Apt, Krzysztof R., 1949- |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA269 |
| callnumber-raw | QA269 .L33 2011eb |
| callnumber-search | QA269 .L33 2011eb |
| callnumber-sort | QA 3269 L33 42011EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | A Primer on Strategic Games / Introduction -- Basic concepts -- Iterated elimination of strategies I -- Mixed extension -- Iterated elimination of strategies II -- Variations on the definition of strategic games -- Mechanism design -- Pre-Bayesian games -- Conclusions -- Infinite Games and Automata Theory / Basic notations and definitions -- Transformation of winning conditions -- Tree automata -- Beyond finite automata -- Conclusion -- Algorithms for Solving Parity Games / Games on graphs -- Solving repeated reachability and eventual safety games. Solving parity games -- Related work -- Back and Forth Between Logic and Games / Reachability games and parity games -- Reachability games and logic -- Logics with least and greatest fixed-points -- Definability of winning regions in parity games -- Inflationary fixed-point logic and backtracking games -- Logic and games in a quantitative setting -- Turn-Based Stochastic Games / Winning objectives in stochastic games -- Reachability objectives in games with finitely and infinitely many vertices -- Some directions of future research -- Games with Imperfect Information: Theory and Algorithms / Games with perfect information. Games with imperfect information: surely-winning -- Games with imperfect information: almost-surely-winning -- Graph Searching Games / Classifying graph searching games -- Variants of graph searching games -- Monotonicity of graph searching -- Obstructions -- An application to graph-decompositions -- Complexity of graph searching -- Beyond Nash Equilibrium: Solution Concepts for the 21st Century / Robust and resilient equilibrium -- Taking computation into account -- Taking (lack of) awareness into account -- Iterated regret minimisation -- Conclusions. |
| ctrlnum | (OCoLC)721938038 |
| dewey-full | 004.015193 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.015193 |
| dewey-search | 004.015193 |
| dewey-sort | 14.015193 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06949cam a2200805 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn721938038</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr mnu---unuuu</controlfield><controlfield tag="008">110510s2011 enka ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">CDX</subfield><subfield code="d">E7B</subfield><subfield code="d">OSU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UKMGB</subfield><subfield code="d">UIU</subfield><subfield code="d">REDDC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">LLB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">IUL</subfield><subfield code="d">UAB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OL$</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">K6U</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">015649243</subfield><subfield code="2">Uk</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139010276</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139010271</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511973468</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511973462</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521198660</subfield><subfield code="q">(hbk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521198666</subfield><subfield code="q">(hbk.)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)721938038</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA269</subfield><subfield code="b">.L33 2011eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">052000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">037000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">013000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">032000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">018000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">014000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">067000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">004.015193</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Lectures in game theory for computer scientists /</subfield><subfield code="c">edited by Krzysztof R. Apt and Erich Grädel.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">©2011.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xii, 295 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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.</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="g">Machine generated contents note:</subfield><subfield code="g">1.</subfield><subfield code="t">A Primer on Strategic Games /</subfield><subfield code="r">Krzysztof R. Apt --</subfield><subfield code="g">1.1.</subfield><subfield code="t">Introduction --</subfield><subfield code="g">1.2.</subfield><subfield code="t">Basic concepts --</subfield><subfield code="g">1.3.</subfield><subfield code="t">Iterated elimination of strategies I --</subfield><subfield code="g">1.4.</subfield><subfield code="t">Mixed extension --</subfield><subfield code="g">1.5.</subfield><subfield code="t">Iterated elimination of strategies II --</subfield><subfield code="g">1.6.</subfield><subfield code="t">Variations on the definition of strategic games --</subfield><subfield code="g">1.7.</subfield><subfield code="t">Mechanism design --</subfield><subfield code="g">1.8.</subfield><subfield code="t">Pre-Bayesian games --</subfield><subfield code="g">1.9.</subfield><subfield code="t">Conclusions --</subfield><subfield code="g">2.</subfield><subfield code="t">Infinite Games and Automata Theory /</subfield><subfield code="r">Christof Loding --</subfield><subfield code="g">2.1.</subfield><subfield code="t">Introduction --</subfield><subfield code="g">2.2.</subfield><subfield code="t">Basic notations and definitions --</subfield><subfield code="g">2.3.</subfield><subfield code="t">Transformation of winning conditions --</subfield><subfield code="g">2.4.</subfield><subfield code="t">Tree automata --</subfield><subfield code="g">2.5.</subfield><subfield code="t">Beyond finite automata --</subfield><subfield code="g">2.6.</subfield><subfield code="t">Conclusion --</subfield><subfield code="g">3.</subfield><subfield code="t">Algorithms for Solving Parity Games /</subfield><subfield code="r">Marcin Jurdzinski --</subfield><subfield code="g">3.1.</subfield><subfield code="t">Games on graphs --</subfield><subfield code="g">3.2.</subfield><subfield code="t">Solving repeated reachability and eventual safety games.</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="g">3.3.</subfield><subfield code="t">Solving parity games --</subfield><subfield code="g">3.4.</subfield><subfield code="t">Related work --</subfield><subfield code="g">4.</subfield><subfield code="t">Back and Forth Between Logic and Games /</subfield><subfield code="r">Erich Gradel --</subfield><subfield code="g">4.1.</subfield><subfield code="t">Introduction --</subfield><subfield code="g">4.2.</subfield><subfield code="t">Reachability games and parity games --</subfield><subfield code="g">4.3.</subfield><subfield code="t">Reachability games and logic --</subfield><subfield code="g">4.4.</subfield><subfield code="t">Logics with least and greatest fixed-points --</subfield><subfield code="g">4.5.</subfield><subfield code="t">Definability of winning regions in parity games --</subfield><subfield code="g">4.6.</subfield><subfield code="t">Inflationary fixed-point logic and backtracking games --</subfield><subfield code="g">4.7.</subfield><subfield code="t">Logic and games in a quantitative setting --</subfield><subfield code="g">5.</subfield><subfield code="t">Turn-Based Stochastic Games /</subfield><subfield code="r">Antonin Kucera --</subfield><subfield code="g">5.1.</subfield><subfield code="t">Introduction --</subfield><subfield code="g">5.2.</subfield><subfield code="t">Winning objectives in stochastic games --</subfield><subfield code="g">5.3.</subfield><subfield code="t">Reachability objectives in games with finitely and infinitely many vertices --</subfield><subfield code="g">5.4.</subfield><subfield code="t">Some directions of future research --</subfield><subfield code="g">6.</subfield><subfield code="t">Games with Imperfect Information: Theory and Algorithms /</subfield><subfield code="r">Jean-Francois Raskin --</subfield><subfield code="g">6.1.</subfield><subfield code="t">Introduction --</subfield><subfield code="g">6.2.</subfield><subfield code="t">Games with perfect information.</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="g">6.3.</subfield><subfield code="t">Games with imperfect information: surely-winning --</subfield><subfield code="g">6.4.</subfield><subfield code="t">Games with imperfect information: almost-surely-winning --</subfield><subfield code="g">7.</subfield><subfield code="t">Graph Searching Games /</subfield><subfield code="r">Stephan Kreuizer --</subfield><subfield code="g">7.1.</subfield><subfield code="t">Introduction --</subfield><subfield code="g">7.2.</subfield><subfield code="t">Classifying graph searching games --</subfield><subfield code="g">7.3.</subfield><subfield code="t">Variants of graph searching games --</subfield><subfield code="g">7.4.</subfield><subfield code="t">Monotonicity of graph searching --</subfield><subfield code="g">7.5.</subfield><subfield code="t">Obstructions --</subfield><subfield code="g">7.6.</subfield><subfield code="t">An application to graph-decompositions --</subfield><subfield code="g">7.7.</subfield><subfield code="t">Complexity of graph searching --</subfield><subfield code="g">7.8.</subfield><subfield code="t">Conclusion --</subfield><subfield code="g">8.</subfield><subfield code="t">Beyond Nash Equilibrium: Solution Concepts for the 21st Century /</subfield><subfield code="r">Joseph Y. Halpern --</subfield><subfield code="g">8.1.</subfield><subfield code="t">Introduction --</subfield><subfield code="g">8.2.</subfield><subfield code="t">Robust and resilient equilibrium --</subfield><subfield code="g">8.3.</subfield><subfield code="t">Taking computation into account --</subfield><subfield code="g">8.4.</subfield><subfield code="t">Taking (lack of) awareness into account --</subfield><subfield code="g">8.5.</subfield><subfield code="t">Iterated regret minimisation --</subfield><subfield code="g">8.6.</subfield><subfield code="t">Conclusions.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Game theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85052941</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer science</subfield><subfield code="x">Mathematics.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85042295</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie des jeux.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Informatique</subfield><subfield code="x">Mathématiques.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Reference.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Machine Theory.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Computer Literacy.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Information Technology.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Data Processing.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Computer Science.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Hardware</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer science</subfield><subfield code="x">Mathematics</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Game theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="655" ind1=" " ind2="0"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Apt, Krzysztof R.,</subfield><subfield code="d">1949-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJrGyD69pW3yyQF8CdbmVC</subfield><subfield code="0">http://id.loc.gov/authorities/names/n77005986</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Grädel, Erich,</subfield><subfield code="d">1958-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJgd9K8rypyQ6QFH6GcdcP</subfield><subfield code="0">http://id.loc.gov/authorities/names/n96097127</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="t">Lectures in game theory for computer scientists.</subfield><subfield code="d">Cambridge : Cambridge University Press, ©2011</subfield><subfield code="z">9780521198660</subfield><subfield code="w">(OCoLC)664324519</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=357388</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH13438415</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Coutts Information Services</subfield><subfield code="b">COUT</subfield><subfield code="n">17892411</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10469073</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">357388</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">6137397</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">6300857</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">6943926</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">5049338</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| genre | Electronic books. |
| genre_facet | Electronic books. |
| id | ZDB-4-EBA-ocn721938038 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:17:49Z |
| institution | BVB |
| isbn | 9781139010276 1139010271 9780511973468 0511973462 |
| language | English |
| oclc_num | 721938038 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (xii, 295 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Cambridge University Press, |
| record_format | marc |
| spelling | Lectures in game theory for computer scientists / edited by Krzysztof R. Apt and Erich Grädel. Cambridge ; New York : Cambridge University Press, ©2011. 1 online resource (xii, 295 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier Includes bibliographical references and index. Print version record. 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. Machine generated contents note: 1. A Primer on Strategic Games / Krzysztof R. Apt -- 1.1. Introduction -- 1.2. Basic concepts -- 1.3. Iterated elimination of strategies I -- 1.4. Mixed extension -- 1.5. Iterated elimination of strategies II -- 1.6. Variations on the definition of strategic games -- 1.7. Mechanism design -- 1.8. Pre-Bayesian games -- 1.9. Conclusions -- 2. Infinite Games and Automata Theory / Christof Loding -- 2.1. Introduction -- 2.2. Basic notations and definitions -- 2.3. Transformation of winning conditions -- 2.4. Tree automata -- 2.5. Beyond finite automata -- 2.6. Conclusion -- 3. Algorithms for Solving Parity Games / Marcin Jurdzinski -- 3.1. Games on graphs -- 3.2. Solving repeated reachability and eventual safety games. 3.3. Solving parity games -- 3.4. Related work -- 4. Back and Forth Between Logic and Games / Erich Gradel -- 4.1. Introduction -- 4.2. Reachability games and parity games -- 4.3. Reachability games and logic -- 4.4. Logics with least and greatest fixed-points -- 4.5. Definability of winning regions in parity games -- 4.6. Inflationary fixed-point logic and backtracking games -- 4.7. Logic and games in a quantitative setting -- 5. Turn-Based Stochastic Games / Antonin Kucera -- 5.1. Introduction -- 5.2. Winning objectives in stochastic games -- 5.3. Reachability objectives in games with finitely and infinitely many vertices -- 5.4. Some directions of future research -- 6. Games with Imperfect Information: Theory and Algorithms / Jean-Francois Raskin -- 6.1. Introduction -- 6.2. Games with perfect information. 6.3. Games with imperfect information: surely-winning -- 6.4. Games with imperfect information: almost-surely-winning -- 7. Graph Searching Games / Stephan Kreuizer -- 7.1. Introduction -- 7.2. Classifying graph searching games -- 7.3. Variants of graph searching games -- 7.4. Monotonicity of graph searching -- 7.5. Obstructions -- 7.6. An application to graph-decompositions -- 7.7. Complexity of graph searching -- 7.8. Conclusion -- 8. Beyond Nash Equilibrium: Solution Concepts for the 21st Century / Joseph Y. Halpern -- 8.1. Introduction -- 8.2. Robust and resilient equilibrium -- 8.3. Taking computation into account -- 8.4. Taking (lack of) awareness into account -- 8.5. Iterated regret minimisation -- 8.6. Conclusions. Game theory. http://id.loc.gov/authorities/subjects/sh85052941 Computer science Mathematics. http://id.loc.gov/authorities/subjects/sh85042295 Théorie des jeux. Informatique Mathématiques. COMPUTERS Reference. bisacsh COMPUTERS Machine Theory. bisacsh COMPUTERS Computer Literacy. bisacsh COMPUTERS Information Technology. bisacsh COMPUTERS Data Processing. bisacsh COMPUTERS Computer Science. bisacsh COMPUTERS Hardware General. bisacsh Computer science Mathematics fast Game theory fast Electronic books. Apt, Krzysztof R., 1949- https://id.oclc.org/worldcat/entity/E39PBJrGyD69pW3yyQF8CdbmVC http://id.loc.gov/authorities/names/n77005986 Grädel, Erich, 1958- https://id.oclc.org/worldcat/entity/E39PBJgd9K8rypyQ6QFH6GcdcP http://id.loc.gov/authorities/names/n96097127 Print version: Lectures in game theory for computer scientists. Cambridge : Cambridge University Press, ©2011 9780521198660 (OCoLC)664324519 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=357388 Volltext |
| spellingShingle | Lectures in game theory for computer scientists / A Primer on Strategic Games / Introduction -- Basic concepts -- Iterated elimination of strategies I -- Mixed extension -- Iterated elimination of strategies II -- Variations on the definition of strategic games -- Mechanism design -- Pre-Bayesian games -- Conclusions -- Infinite Games and Automata Theory / Basic notations and definitions -- Transformation of winning conditions -- Tree automata -- Beyond finite automata -- Conclusion -- Algorithms for Solving Parity Games / Games on graphs -- Solving repeated reachability and eventual safety games. Solving parity games -- Related work -- Back and Forth Between Logic and Games / Reachability games and parity games -- Reachability games and logic -- Logics with least and greatest fixed-points -- Definability of winning regions in parity games -- Inflationary fixed-point logic and backtracking games -- Logic and games in a quantitative setting -- Turn-Based Stochastic Games / Winning objectives in stochastic games -- Reachability objectives in games with finitely and infinitely many vertices -- Some directions of future research -- Games with Imperfect Information: Theory and Algorithms / Games with perfect information. Games with imperfect information: surely-winning -- Games with imperfect information: almost-surely-winning -- Graph Searching Games / Classifying graph searching games -- Variants of graph searching games -- Monotonicity of graph searching -- Obstructions -- An application to graph-decompositions -- Complexity of graph searching -- Beyond Nash Equilibrium: Solution Concepts for the 21st Century / Robust and resilient equilibrium -- Taking computation into account -- Taking (lack of) awareness into account -- Iterated regret minimisation -- Conclusions. Game theory. http://id.loc.gov/authorities/subjects/sh85052941 Computer science Mathematics. http://id.loc.gov/authorities/subjects/sh85042295 Théorie des jeux. Informatique Mathématiques. COMPUTERS Reference. bisacsh COMPUTERS Machine Theory. bisacsh COMPUTERS Computer Literacy. bisacsh COMPUTERS Information Technology. bisacsh COMPUTERS Data Processing. bisacsh COMPUTERS Computer Science. bisacsh COMPUTERS Hardware General. bisacsh Computer science Mathematics fast Game theory fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85052941 http://id.loc.gov/authorities/subjects/sh85042295 |
| title | Lectures in game theory for computer scientists / |
| title_alt | A Primer on Strategic Games / Introduction -- Basic concepts -- Iterated elimination of strategies I -- Mixed extension -- Iterated elimination of strategies II -- Variations on the definition of strategic games -- Mechanism design -- Pre-Bayesian games -- Conclusions -- Infinite Games and Automata Theory / Basic notations and definitions -- Transformation of winning conditions -- Tree automata -- Beyond finite automata -- Conclusion -- Algorithms for Solving Parity Games / Games on graphs -- Solving repeated reachability and eventual safety games. Solving parity games -- Related work -- Back and Forth Between Logic and Games / Reachability games and parity games -- Reachability games and logic -- Logics with least and greatest fixed-points -- Definability of winning regions in parity games -- Inflationary fixed-point logic and backtracking games -- Logic and games in a quantitative setting -- Turn-Based Stochastic Games / Winning objectives in stochastic games -- Reachability objectives in games with finitely and infinitely many vertices -- Some directions of future research -- Games with Imperfect Information: Theory and Algorithms / Games with perfect information. Games with imperfect information: surely-winning -- Games with imperfect information: almost-surely-winning -- Graph Searching Games / Classifying graph searching games -- Variants of graph searching games -- Monotonicity of graph searching -- Obstructions -- An application to graph-decompositions -- Complexity of graph searching -- Beyond Nash Equilibrium: Solution Concepts for the 21st Century / Robust and resilient equilibrium -- Taking computation into account -- Taking (lack of) awareness into account -- Iterated regret minimisation -- Conclusions. |
| title_auth | Lectures in game theory for computer scientists / |
| title_exact_search | Lectures in game theory for computer scientists / |
| title_full | Lectures in game theory for computer scientists / edited by Krzysztof R. Apt and Erich Grädel. |
| title_fullStr | Lectures in game theory for computer scientists / edited by Krzysztof R. Apt and Erich Grädel. |
| title_full_unstemmed | Lectures in game theory for computer scientists / edited by Krzysztof R. Apt and Erich Grädel. |
| title_short | Lectures in game theory for computer scientists / |
| title_sort | lectures in game theory for computer scientists |
| topic | Game theory. http://id.loc.gov/authorities/subjects/sh85052941 Computer science Mathematics. http://id.loc.gov/authorities/subjects/sh85042295 Théorie des jeux. Informatique Mathématiques. COMPUTERS Reference. bisacsh COMPUTERS Machine Theory. bisacsh COMPUTERS Computer Literacy. bisacsh COMPUTERS Information Technology. bisacsh COMPUTERS Data Processing. bisacsh COMPUTERS Computer Science. bisacsh COMPUTERS Hardware General. bisacsh Computer science Mathematics fast Game theory fast |
| topic_facet | Game theory. Computer science Mathematics. Théorie des jeux. Informatique Mathématiques. COMPUTERS Reference. COMPUTERS Machine Theory. COMPUTERS Computer Literacy. COMPUTERS Information Technology. COMPUTERS Data Processing. COMPUTERS Computer Science. COMPUTERS Hardware General. Computer science Mathematics Game theory Electronic books. |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=357388 |
| work_keys_str_mv | AT aptkrzysztofr lecturesingametheoryforcomputerscientists AT gradelerich lecturesingametheoryforcomputerscientists |