# Schedule
This is a directed study course in Computer Science. In Spring 2026, the group will investigate algorithms to solve large games, with a large number of actions (close to continuous games) or a large number of players (close to non-atomic games). In particular, we will look into solving a class of facility location games and routing congestion games.
| Week |
Date |
Topic |
Notes |
| 1 |
- |
Support Enumeration |
W1 |
| 2 |
- |
Vertex Enumeration |
W2 |
| 3 |
- |
Continuous Games |
W3 |
| 4 |
- |
Non-atomic Games |
W4 |
| 5 |
- |
Best Response Dynamics |
W5 |
| 6 |
- |
Fictitious Play |
W6 |
| 7 |
- |
Replicator Dynamics |
W7 |
| 8 |
- |
Project |
W8 |
| 9 |
- |
Project |
W9 |
| 10 |
- |
Project |
W10 |
| 11 |
- |
Project |
W11 |
| 12 |
- |
Project |
W12 |
| 13 |
- |
Project |
W13 |
| 14 |
- |
Project |
W14 |
| 15 |
- |
Project |
W15 |
Textbook (main):
📗 Algorithmic Game Theory:
Link.
Notes from previous semesters:
📗 Partial Observability:
Link 📗 Multi-agent deep learning:
Link 📗 Single-agent deep learning:
Link 📗 Multi-agent discrete state:
Link