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 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.

Table of Contents

Chapter 1 A Primer on Strategic Games
Chapter 2 Infinite Games and Automata Theory
Chapter 3 Algorithms for Solving Parity Games
Chapter 4 Back and Forth Between Logic and Games
Chapter 5 Turn-Based Stochastic Games
Chapter 6 Games with Imperfect Information: Theory and Algorithms
Chapter 7 Graph Searching Games
Chapter 8 Beyond Nash Equilibrium: Solution Concepts for the 21st Century