Lectures in game theory for computer scientists
Lectures in game theory for computer scientists
edited by Krzysztof R. Apt and Erich Grädel.
- Cambridge : Cambridge University Press, c2011.
- xii, 295 p. : ill. ; 26 cm.
Includes bibliographical references and index.
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 / Introduction -- 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 Krzysztof R. Apt -- Christof Loding -- Marcin Jurdzinski -- Machine generated contents note: 1. 1.1. 1.2. 1.3. 1.4. 1.5. 1.6. 1.7. 1.8. 1.9. 2. 2.1. 2.2. 2.3. 2.4. 2.5. 2.6. 3. 3.1. 3.2. Solving parity games -- Related work -- Back and Forth Between Logic and Games / Introduction -- 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 / Introduction -- 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 / Introduction -- Games with perfect information Erich Gradel -- Antonin Kucera -- Jean-Francois Raskin -- 3.3. 3.4. 4. 4.1. 4.2. 4.3. 4.4. 4.5. 4.6. 4.7. 5. 5.1. 5.2. 5.3. 5.4. 6. 6.1. 6.2. Games with imperfect information: surely-winning -- Games with imperfect information: almost-surely-winning -- Graph Searching Games / Introduction -- Classifying graph searching games -- Variants of graph searching games -- Monotonicity of graph searching -- Obstructions -- An application to graph-decompositions -- Complexity of graph searching -- Conclusion -- Beyond Nash Equilibrium: Solution Concepts for the 21st Century / Introduction -- Robust and resilient equilibrium -- Taking computation into account -- Taking (lack of) awareness into account -- Iterated regret minimisation -- Conclusions. Stephan Kreuizer -- Joseph Y. Halpern -- 6.3. 6.4. 7. 7.1. 7.2. 7.3. 7.4. 7.5. 7.6. 7.7. 7.8. 8. 8.1. 8.2. 8.3. 8.4. 8.5. 8.6.
9780521198660 (hbk.) 0521198666 (hbk.) = EECS-reference book collection
2011499849
GBB0B0491 bnb
015649243 Uk
Game theory.
Computer science--Mathematics.
QA269 / .L43 2011
004.015193 Ap8L
Includes bibliographical references and index.
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 / Introduction -- 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 Krzysztof R. Apt -- Christof Loding -- Marcin Jurdzinski -- Machine generated contents note: 1. 1.1. 1.2. 1.3. 1.4. 1.5. 1.6. 1.7. 1.8. 1.9. 2. 2.1. 2.2. 2.3. 2.4. 2.5. 2.6. 3. 3.1. 3.2. Solving parity games -- Related work -- Back and Forth Between Logic and Games / Introduction -- 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 / Introduction -- 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 / Introduction -- Games with perfect information Erich Gradel -- Antonin Kucera -- Jean-Francois Raskin -- 3.3. 3.4. 4. 4.1. 4.2. 4.3. 4.4. 4.5. 4.6. 4.7. 5. 5.1. 5.2. 5.3. 5.4. 6. 6.1. 6.2. Games with imperfect information: surely-winning -- Games with imperfect information: almost-surely-winning -- Graph Searching Games / Introduction -- Classifying graph searching games -- Variants of graph searching games -- Monotonicity of graph searching -- Obstructions -- An application to graph-decompositions -- Complexity of graph searching -- Conclusion -- Beyond Nash Equilibrium: Solution Concepts for the 21st Century / Introduction -- Robust and resilient equilibrium -- Taking computation into account -- Taking (lack of) awareness into account -- Iterated regret minimisation -- Conclusions. Stephan Kreuizer -- Joseph Y. Halpern -- 6.3. 6.4. 7. 7.1. 7.2. 7.3. 7.4. 7.5. 7.6. 7.7. 7.8. 8. 8.1. 8.2. 8.3. 8.4. 8.5. 8.6.
9780521198660 (hbk.) 0521198666 (hbk.) = EECS-reference book collection
2011499849
GBB0B0491 bnb
015649243 Uk
Game theory.
Computer science--Mathematics.
QA269 / .L43 2011
004.015193 Ap8L