Instructor: Noam Nisan
Recently we have seen research that combines topics and points of view of economic theory, game theory, and theoretical computer science. Part of the motivation for this combination is the Internet which, on one hand, carries complex computerassisted economic transactions, and, on the other hand, involves cooperation and competition between technological systems that are owned and operated by different players with different goals. Studying and designing such systems and applications requires integrating the economic and computational considerations. This course will introduce some of the issues on this border of computation, economics, and gametheory.
Each student is expected to prepare scribe notes for one lecture. Here is a basic LaTeX template to use. Here are various LaTeX tutorials.
Scribe notes:
Lecture 
Date 
Topic 
Scribes 
1 
30.10 


2 
6.11 
Minmax
theorem; randomized algorithms; gametree evaluation 

3 
13.11 
Gametree evaluation;
Generalsum games Pure Nash equilibrium; 
Maor BenDayan 
4 
20.11 


5 
27.11 
Robby Lampert 

6 
4.12 
Price of anarchy and Mixed
Nash equilibrium 
 
7 
11.12 
Nash's Theorem,
Computational hardness, and Correlated equilibrium 
Yoram Bachrach 
8 
18.12 
Social choice, Arrow's
theorem, GibbardSatterswaite theorem 
Ofer Dekel 
9 
25.12 
Ilan Nehama 

10 
1.1 
Hanukah vacation – you can go
the Israeli seminar on gametheory in Ra’anana 
 
11 
8.1 
Michael Zuckerman 

12 
15.1 
Mechanism design, truthfulness,
revelation principle 
 
13 
22.1 
VCG mechanism,
Combinatorial auctions 
 
14 
29.1 
Combinatorial auctions 
 
Here is the current list of grades. I will wait a little more to get the lecture notes from those who have not handed them in yet. The formula for final grade is 34% for each exercise and 34% for the lecture notes.