COMP 567: STRATEGIC COMPUTATION
Spring 2027 · Section 001 · CRN 26762
This course develops the mathematical and computational foundations for strategic interaction in computing systems. Topics include game-theoretic models and equilibrium concepts; algorithms and complexity for equilibrium computation; price of anarchy; online and no-regret learning; learning in games; algorithmic mechanism and contract design; and applications to strategic machine learning, data and AI markets, privacy, and preference learning. Recommended Prerequisite(s): COMP 382 or an equivalent undergraduate algorithms course; one course in probability or statistics (ELEC 303 OR STAT 310 OR STAT 311 OR STAT 312 OR STAT 315 OR DSCI 301 OR ECON 307) and familiarity with linear algebra and basic optimization, especially linear programming.
- Credits
- 3
- Instructors
- Alireza Fallah