AGTA - Course Materials

Lecture 1 - 12 January 2025
Slides: What is Game Theory?   
No required reading. 
Some reference texts for the entire course (see slides of lecture 1 for a more comprehensive list):

• M. Maschler, E. Solan, and S. Zamir, Game Theory , Cambridge U. Press, 2013. 
  (Available online from the University Library.)
• N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, Algorithmic Game Theory, Cambridge U. Press, 2007. 
  (Available online from the University library.)
• Y. Shoham and K. Leyton-Brown, "Multi-agent Systems: algorithmic, game-theoretic, and logical foundations", 2009. (MAS) 
  (Available online from the University library.)
• T. Roughgarden. Twenty Lectures on Algorithmic Game Theory, Cambridge U. Press, 2016. 
  (Available online from the University library.)

Lecture 2  & Lecture 3 - 15th and 19th of January 2025
Slides for Lecture 2: Mixed Strategies, Expected Payoffs, and Nash Equilibrium.
Slides for Lecture 3: Nash's Theorem.

Reading for Lectures 2 and 3:
The classic:  John Nash, ``Non-cooperative Games'',  Annals of Mathematics, 1951.  (Only read pages 286--288.) 

Supplementary (not required) textbook reading for Lectures 2 and 3:
[Shoham&Leyton-Brown, Multi-Agent Systems (MAS) book, 2009, Chapter 3]
(This book is available digitally from the Edinburgh University Library.)