Lectures in Game Theory for Computer Scientists

Krzysztof R. Apt, Christof Löding, Marcin Jurdzinski, Erich Grädel, Antonı́n Kučera, Laurent Doyen, Stephan Kreutzer, Joseph Y. HalpernCambridge 2011 · DOI · OpenAlex

Abstract

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.
BibTeX
@inproceedings{apt2011lectures,
  author = {Krzysztof R. Apt and Krzysztof R. Apt and Krzysztof R. Apt and Krzysztof R. Apt and Christof Löding and Marcin Jurdzinski and Erich Grädel and Antonı́n Kučera and Laurent Doyen and Stephan Kreutzer and Joseph Y. Halpern and Joseph Halpern},
  title = {{Lectures in Game Theory for Computer Scientists}},
  booktitle = {Cambridge},
  year = {2011},
  doi = {10.1017/cbo9780511973468},
}

Loading related content...

Figure