CS 224M : Multi Agent Systems
We will be running a flipped classroom this year. All the material is recorded, and you are asked to view the relevant material ahead of each class meeting. Alongside the recorded lectures are quizzes, and also interactive material (basically you'll be playing online games against real or synthetic agents). The quizzes will not be graded; there will be traditional homeworks and midterm. Will be using Piazza for online discussions among the students, and between the students and the staff.
It is early days for flipped classrooms, and the jury is still out on them. Clearly, like everything else, they can be done poorly. The bet is that they can also be done well. We are making an effort to make it successful, but we need your cooperation. Most class sessions will be divided into two parts -- first enrichment material, followed recitation. Professor Shoham will lead the enrichment material, sometimes alone and sometimes with a guest lecturer. The recitation session will be led by the TAs. And here is our request from you. Flipped classrooms can tempt you to never show up for class, but that will significantly detract from the experience, both your own and that of your fellow students. So we ask that you show up to class. Please try to come to all meetings, and definitely don't miss more than two. We'll take attendance; not because we're in the police business, but because it's part of the bargain we're asking you to enter into when taking this class. You may leave the classroom once the recitation part starts if you feel you don't have anything to gain from it. If you have special circumstances that require your being absent more than twice, please let us know and we'll be reasonable.
Mondays 2:15-4:05pm in 420-041 (Jordan Hall)
All lecture slides are available on the course website. Additional required reading material will be the textbook by Professor Shoham, co-authored with Kevin Leyton-Brown: Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations (Cambridge University Press, 2009). A slightly rough version is available here.
We will have 4 homeworks, an in class midterm on 5/20 Monday, and a final paper.
Your grade will depend on all of them in addition to attendance.
The grade allocation to each of these components will be:
Homeworks = 40% | Midterm = 50% | Attendance* = 10% | Final Paper** (see below)
Homeworks will be handed out in lectures on Mondays and available online afterwards.
They will be due the following Wednesday at 2pm in a box outside Gates 128.
You could claim your homework extensions up to two times for homeworks #1, #2, and #4 (but not #3) -- but one extension per assignment.
If you claim your homework extension, you can submit by the following Monday at 2pm.
While we do our best to make questions unambiguous, some questions may still remain unclear. Please ask on the forums if you are confused.
(*) We have 8 lectures (not counting the midterm and holiday), and we require you to attend at least 6 of them. If you attend 6, you will get your 10%. If you attend 5 or fewer, you will get zero. We will be reasonable, however, about extraordinary circumstances (see the 'Flipped Classrom' section above).
(**) Your Final Paper is graded on the A/B/C basis, which could change your letter grade up to a full grade up or down.
Roughly speaking, getting an A on your final paper could increase your final letter grade up to a full grade (analogous for a C).
Please post your questions, comments, concerns, or anything related to the course on Piazza. We will try to respond as soon as possible.
If you need special needs or accomodations, or have questions/concerns that cannot be posted on Piazza for some reason,
send an email to the staff mailing list (NOTE: you must send an email from your @stanford.edu account, otherwise it will be auto-rejected by the system).
If we think it is more appropriate to post your question on Piazza, we may ask you to post it on Piazza instead.
Email sent directly to the TAs and/or instructor may get low priority or be ignored.
You will have the opportunity to participate in some periodic online 'lab exercises' which will allow you to play some of the games that we discuss in the lectures. Links to specific games will be provided at the end of some lecture videos. Like the quizzes, these will not be graded. We will usually ask you to complete these before the corresponding material is covered in lecture, so that you have a chance to experience some of the games before we provide a formal game theoretic analysis of them.
We encourage students to form study groups and discuss the lecture videos (including in-video questions). We also encourage you to get together with friends to watch the videos together as a group. However, the answers that you submit for the problem sets and midterm should be your own work; students are encouraged to discuss concepts and problems, but are NOT allowed to share their answers to problem sets and midterm. We ask that you do not share your solutions to any of the problem sets and midterm with any other students. This includes any sort of sharing, whether face-to-face, by email, uploading onto public sites, etc. Doing so will drastically detract from the learning experience of your fellow students, and any attempt to do so will be considered a clear honor code violation.
|Dates||Content (subject to change)||Released||Due Dates|
First class (Yoav)
Week 1: Introduction and Normal Form Games
Videos: 1.1-1.10, 2.1-2.2
Readings: Ch 3.1-3.3
(a) Course logistics (Haden)
(b) Game Theory Applications (Haden)
(c) Recitation: Review and Practice Problems (Sean)
Week 2: Solution Concepts and Computation in Game Theory
Videos: 2.3-2.6, 3.1-3.5
Readings: Ch 3.4, Ch 4, Ch 6.5
|HW #1 Released|
(a) Interactive Exercises and Lecture on Learning (Yoav)
(b) Recitation (Daniel)
Week 3: Extensive Form Games
Readings: Ch 5, Ch 6.5
| HW #1
(due by 4/17 Wed)
(a) Joint Class with ECON 160
(details to be announced)
(b) Recitation (Sean)
Week 4: Repeated Games
Readings: Ch 6.1-6.2
|HW #2 Released|
(a) Lecture on Knowledge and Belief (Yoav)
(b) Recitation (Haden)
Week 5: Coalitional Games and Bayesian Games
Videos: 6.1-6.5, 7.1-7.5
Readings: Ch 12.1-2, Ch 6.3
| HW #2
(due by 5/1 Wed)
(a) Lecture on Knowledge and Belief (continued, Yoav)
(b) Recitation (Haden)
Week 6: Multi-Agent Learning (and Congestion Games)
Videos: No videos (but re-watch 5.4 for related topics).
Readings: Ch 7, Ch 6.4
|HW #3 Released|
(a) Invited Lecture by
(b) Recitation: Review for midterm (Daniel)
Week 7: Social Choice
Readings: Ch 9
| HW #3
(due by 5/15 Wed)
Week 8: Mechanism Design
Videos: All videos of Unit 9.
Readings: Ch 10.1-10.3
| Final Paper
(due by 5/24 Fri)
5/27 (Mon)No classes, Memorial day
Week 9 : The VCG Mechanisms
Videos: All videos of Unit 10.
Readings: Ch 10.4-10.5 (optional: 10.6-10.7)
|HW #4 Released|| Final Paper
(due by 5/31 Fri)
(a) Invited Lecture TBD
(b) Bonus Material and Wrap-up
Week 10: Auctions
Videos: All videos of Unit 11.
Readings: Ch 11.1-11.2 (optional: 11.3-11.4)
| HW #4
(due by 6/5 Wed)
6/10 (Mon) by 4pm
|final exams week|| Final Paper
(due by 6/10 Mon by 4pm)