TY  - BOOK
AU  - Apt,Krzysztof R.
AU  - Grädel,Erich
TI  - Lectures in game theory for computer scientists
SN  - 9780521198660
PY  - 2011///
CY  - Cambridge
PB  - Cambridge University Press
KW  - Game theory
KW  - Computer science
KW  - Mathematics
N1  - Includes bibliographical references and index; 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; ˜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
ER  -