Lectures in game theory for computer scientists / edited by Krzysztof R. Apt and Erich Gradel.
By: Apt, Krzysztof R.
Contributor(s): Gradel, Erich.
Material type: TextPublisher: Cambridge : Cambridge University Press, c2011Description: xii, 295 p., UKP 45.00 ill. ; 26 cm.ISBN: 9780521198660 (hbk.); 0521198666 (hbk.).Subject(s): Game theory | Computer science -- MathematicsDDC classification: 004.015193Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
Book | Chennai Mathematical Institute General Stacks | 511.35 APT (Browse shelf) | Available | 10036 | ||
Book | Chennai Mathematical Institute General Stacks | 511.35 APT (Browse shelf) | Available | 8027 |
Browsing Chennai Mathematical Institute Shelves , Shelving location: General Stacks Close shelf browser
511.34 OTT Bounded variable logics and counting : a study in finite models / | 511.34 WEA Forcing for mathematicians / | 511.35 AAR Quantum computing since Democritus / | 511.35 APT Lectures in game theory for computer scientists / | 511.35 APT Lectures in game theory for computer scientists / | 511.35 BAR Lambda calculus with types / | 511.35 DSO Modern applications of automata theory / |
Includes bibliographical references and index.
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.