Lecturer: Yishay Mansour (mansour@tau.ac.il)
Time & Place : Monday 9-12, Kaplun Building Room 118
This is a tentative list of the subjects (not all will be covered):
1. Introduction pptx
2. Quality of Equilibrium (Price of Anarchy)
c. Price of Stability & Strong Price of Anarchy pptx
3. Equilibrium Existence
4. Regret Minimization
a. External (including dynamics)
b. Swap (and calibration and Multi-Arm-Bandit)
5. Mechanism Design
b. Maximizing Social Welfare (VCG)
s
GRADE:
Scribe
notes: Each student will write a scribe note for a lecture (template [pdf,tex]
explanation on Latex [pdf,tex])
HOMEWORK
Home work 1 (handed out March 8, 2010)
o
Michael
Kearns, Computational Game Theory,
o
Adrian
Vetta, Algorithmic
Game Theory,
o
Eva Tardos, Algorithmic
Game Theory,
o
Tim Roughgarden, Algorithmic
Game Theory,
o
Christos
Papadimitriou, Algorithmic Aspects of Game Theory,
o
Joan
Feigenbaum, Economics
and Computation,
o
Noam
Nisan, CS, Game theory, and Economics,
o
Peter
Bro Miletersen, Algorithmic
game theory, Fall 2008,
o
Vincent
Conitzer , Computational Game Theory and Mechanism Design ,
o
Kousha Etessami, Algorithmic
Game Theory and Applications , 2003- 2008,
o Adam Tauman Kalai, Game Theory and Computer Science, Spring 2008, Georgia Tech
o
Amos
Fiat, Computational Game Theory, Spring 2008,
o David Parkes, Computational Mechanism Design, Spring 2007
·
Books Surveys:
o
o Paul W.
Goldberg,
o Survey of Algorithmic Game Theory, Tim Roughgarden,
Stanford.