Algorithmic Game Theory: Mandatory Literature

The following references are fundamental and every participant should be familiar with them.

• Tim Roughgarden, Algorithmic Game Theory, Comm. ACM, volume 53, number 7, pages 78-86, 2010
• Gary Anthes, Mechanism Design Meets Computer Science, Comm. ACM, volume 53, number 8, pages 11-13, 2010

Scheduling: Mandatory Literature

The following references are fundamental and every participant should be familiar with them.

• Kwok and Ahmad, Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors, ACM Computing Surveys, volume 31, number 4, 1999
• Pindeo, Deterministic Models: Preliminaries, in Scheduling, 2008

Optional Reading

The following references will be helpful in grasping the material provided to the students.

• Roger B. Myerson
  Game Theory: Analysis of Conflict
  Harvard University Press, 1991
  ISBN: 0-674-34116-3
• Noam Nisan, Tim Roughgarden, Eva Tardos and Vijay V. Vazirani (editors)
  Algorithmic Game Theory
  Georgia Institute of Technology Cambridge University Press, 2007
  ISBN 978-0-521-87282-9