Cooperative games are games where players work together, communicate through signals, and establish conventions to achieve collective goals.
In this course, we will play and analyze the strategy of various cooperative games, particularly those with deep, open-ended underlying strategies, such as Hat Guessing Games, Contract Bridge, and, most extensively, Hanabi.
The majority of class time will be dedicated to playing cooperative games, though we will also have brief lectures and group discussions. As such, attendance is mandatory as in-class participation is the primary way you will engage with course material. If class returns to in person, we will have a strict in-person only policy to foster a fun games environment. We will have occasional labs outside of class, and encourage you all to continue playing cooperative games outside of class.
Familiarity with Python (at a CS61A/CS88 level) is highly recommended. This is mostly for the Hanabi lab, which will be a short implementation of a few strategies in code. That said, if you don’t have prior programming experience, let us know and we can work something out!
If you have any questions, please feel free to email either of the course facilitators:
Sohum Hulyalkar: sohum11@berkeley.edu
Nima Rezaeian: nima_rez@berkeley.edu
Get excited!
No day(s) left until application deadline!
Section | Facilitator | Size | Location | Time | Starts | Status | CCN(LD) | CCN(UD) |
---|---|---|---|---|---|---|---|---|
Cooperative Games DeCal | Sohum & Nima | 35 | Soda 310 | [M] 6:30PM-8:00PM | 1/31/2022 | Open | -- | -- |
Name | Download Link | ||
---|---|---|---|