| |
|
| Date |
Chapter |
Topic |
Assignment |
| T 1/20 |
|
Course Overview |
|
| Th 1/22 |
1 |
Basic Solution Concepts and Computational Issues |
|
| T 1/27 |
1 |
Basic Solution Concepts and Computational Issues |
|
| Th 1/29 |
2 |
The Complexity of Finding Nash Equilibria |
|
| T 2/3 |
3 |
Equilibrium Computation for Two-Player Games in Strategic and
Extensive Form |
|
| Th 2/5 |
4 |
Learning, Regret Minimization, and Equilibria |
1 out |
| T 2/10 |
4 |
Learning, Regret Minimization, and Equilibria |
|
| Th 2/12 |
5 |
Combinatorial Algorithms for Market Equilibria |
|
| T 2/17 |
5 |
Combinatorial Algorithms for Market Equilibria |
|
| Th 2/19 |
6 |
Computation of Market Equilibria by Convex Programming |
|
| T 2/24 |
9 |
Introduction to Mechanism Design (for Computer Scientists) |
1 in, 2 out |
| Th 2/26 |
9 |
Introduction to Mechanism Design (for Computer Scientists) |
|
| T 3/3 |
10 |
Mechanism Design without Money |
|
| Th 3/5 |
11 |
Combinatorial Auctions |
|
| T 3/10 |
11 |
Combinatorial Auctions |
|
| Th 3/12 |
12 |
Computationally Efficient Approximation Mechanisms |
2 in, 3 out |
| T 3/17 |
|
SPRING BREAK |
|
| Th 3/19 |
|
SPRING BREAK |
|
| T 3/24 |
13 |
Profit Maximization in Mechanism Design |
|
| Th 3/26 |
13 |
Profit Maximization in Mechanism Design |
project proposal in |
| T 3/31 |
14 |
Distributed Algorithmic Mechanism Design |
|
| Th 4/2 |
14 |
Distributed Algorithmic Mechanism Design |
3 in, 4 out |
| T 4/7 |
15 |
Cost Sharing |
|
| Th 4/9 |
16 |
Online Mechanisms |
|
| T 4/14 |
16 |
Online Mechanisms |
|
| Th 4/16 |
|
Research Presentation |
|
| T 4/21 |
17 |
Introduction to the Inefficiency of Equilibria |
4 in, 5 out |
| Th 4/23 |
18 |
Routing Games |
|
| T 4/28 |
26 |
Computational Aspects of Prediction Markets |
|
| Th 4/30 |
28 |
Sponsored Search Auctions |
project in |
| T 5/5 |
28 |
Sponsored Search Auctions |
|
| Th 5/7 |
|
Research Presentation |
5 in |