Course Schedule and Catalog
Course Schedule - Spring Semester 2027
Meeting location information can now be found on student schedules in ESTHER (for students) or on the Course Roster in ESTHER (for faculty and instructors).Additional information available here.
Meeting location information can now be found on student schedules in ESTHER (for students) or on the Course Roster in ESTHER (for faculty and instructors).Additional information available here.
COMP 567 001 (CRN: 26762)
STRATEGIC COMPUTATION
Long Title: STRATEGIC COMPUTATION: ALGORITHMS, GAME THEORY, AND MECHANISM DESIGN
Department: Computer Science
Instructor: Fallah, Alireza
Meeting: 2:00PM - 3:15PM WF (11-JAN-2027 - 23-APR-2027)
Part of Term: Full Term
Grade Mode: Standard Letter
Course Type: Lecture
Language of Instruction: Taught in English
Method of Instruction: Face to Face
Credit Hours: 3
Course Syllabus:
Course Materials: Rice Campus Store
Restrictions:
Must be enrolled in one of the following Level(s):
Graduate
Section Max Enrollment: 30
Section Enrolled: 0
Enrollment data as of: 2-NOV-2026 1:43PM
Final Exam: GR Course-Dept Schedules Exam
Description: 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.