Lectures in game theory for computer scientists
By: edited by Krzysztof R. Apt and Erich Grädel
Publisher: Cambridge University Press
Published: 2011
Place of publication: Cambridge
Language: eng
Number of pages: 295
ISBN-13: 9780521198660
Subjects: Mathematics; Computer science; Game theory
Notes: Includes bibliographical references and index.
Table of contents: title: Machine generated contents note: -- 1.; title: A Primer on Strategic Games  -- Krzysztof R. Apt -- 1.1.; title: Introduction -- -- 1.2.; title: Basic concepts -- -- 1.3.; title: Iterated elimination of strategies I -- -- 1.4.; title: Mixed extension -- -- 1.5.; title: Iterated elimination of strategies II -- -- 1.6.; title: Variations on the definition of strategic games -- -- 1.7.; title: Mechanism design -- -- 1.8.; title: Pre-Bayesian games -- -- 1.9.; title: Conclusions -- -- 2.; title: Infinite Games and Automata Theory  -- Christof Loding -- 2.1.; title: Introduction -- -- 2.2.; title: Basic notations and definitions -- -- 2.3.; title: Transformation of winning conditions -- -- 2.4.; title: Tree automata -- -- 2.5.; title: Beyond finite automata -- -- 2.6.; title: Conclusion -- -- 3.; title: Algorithms for Solving Parity Games  -- Marcin Jurdzinski -- 3.1.; title: Games on graphs -- -- 3.2.; title: Solving repeated reachability and eventual safety games; title: 3.3.; title: Solving parity games -- -- 3.4.; title: Related work -- -- 4.; title: Back and Forth Between Logic and Games  -- Erich Gradel -- 4.1.; title: Introduction -- -- 4.2.; title: Reachability games and parity games -- -- 4.3.; title: Reachability games and logic -- -- 4.4.; title: Logics with least and greatest fixed-points -- -- 4.5.; title: Definability of winning regions in parity games -- -- 4.6.; title: Inflationary fixed-point logic and backtracking games -- -- 4.7.; title: Logic and games in a quantitative setting -- -- 5.; title: Turn-Based Stochastic Games  -- Antonin Kucera -- 5.1.; title: Introduction -- -- 5.2.; title: Winning objectives in stochastic games -- -- 5.3.; title: Reachability objectives in games with finitely and infinitely many vertices -- -- 5.4.; title: Some directions of future research -- -- 6.; title: Games with Imperfect Information: Theory and Algorithms  -- Jean-Francois Raskin -- 6.1.; title: Introduction -- -- 6.2.; title: Games with perfect information; title: 6.3.; title: Games with imperfect information: surely-winning -- -- 6.4.; title: Games with imperfect information: almost-surely-winning -- -- 7.; title: Graph Searching Games  -- Stephan Kreuizer -- 7.1.; title: Introduction -- -- 7.2.; title: Classifying graph searching games -- -- 7.3.; title: Variants of graph searching games -- -- 7.4.; title: Monotonicity of graph searching -- -- 7.5.; title: Obstructions -- -- 7.6.; title: An application to graph-decompositions -- -- 7.7.; title: Complexity of graph searching -- -- 7.8.; title: Conclusion -- -- 8.; title: Beyond Nash Equilibrium: Solution Concepts for the 21st Century  -- Joseph Y. Halpern -- 8.1.; title: Introduction -- -- 8.2.; title: Robust and resilient equilibrium -- -- 8.3.; title: Taking computation into account -- -- 8.4.; title: Taking (lack of) awareness into account -- -- 8.5.; title: Iterated regret minimisation -- -- 8.6.; title: Conclusions.