Stanford Root

Schedule

Stanford Root

Schedule

CS 269I

Incentives in Computer Science (MS&E 206)

UNITS:3
GRADING:Letter or Credit/No Credit
LEVEL:Graduate
GER:—

Many 21st-century computer science applications require the design of software or systems that interact with multiple self-interested participants. This course will provide students with the vocabulary and modeling tools to reason about such design problems. Emphasis will be on understanding basic economic and game theoretic concepts that are relevant across many application domains, and on case studies that demonstrate how to apply these concepts to real-world design problems. Topics include auction and contest design, equilibrium analysis, cryptocurrencies, design of networks and network protocols, reputation systems, social choice, and social network analysis. Case studies include BGP routing, Bitcoin, eBay's reputation system, Facebook's advertising mechanism, Mechanical Turk, and dynamic pricing in Uber/Lyft. Prerequisites: CS 106B/X and CS 161, or permission from the instructor.

Syllabus for selected term:
View Spring 2027 Syllabus

Sections

1 Term
Lecture 1Open
ID: 25871
0 / 999 enrolled
DAYS:TBD
TIME:TBD
LOCATION:TBD
INSTRUCTOR:
Rubinstein, Aviad
3units

CS 269I: Incentives in Computer Science (MS&E 206)

3 units · Letter or Credit/No Credit

Many 21st-century computer science applications require the design of software or systems that interact with multiple self-interested participants. This course will provide students with the vocabulary and modeling tools to reason about such design problems. Emphasis will be on understanding basic economic and game theoretic concepts that are relevant across many application domains, and on case studies that demonstrate how to apply these concepts to real-world design problems. Topics include auction and contest design, equilibrium analysis, cryptocurrencies, design of networks and network protocols, reputation systems, social choice, and social network analysis. Case studies include BGP routing, Bitcoin, eBay's reputation system, Facebook's advertising mechanism, Mechanical Turk, and dynamic pricing in Uber/Lyft. Prerequisites: CS106B/X and CS161, or permission from the instructor.

Offered in Spring 2027 at Stanford University.

Spring 2027 sections

  • Lecture — TBA TBA — Rubinstein, Aviad (Graduate)

More CS courses

  • CS 257: Introduction to Automated Reasoning
  • CS 258: Quantum Cryptography
  • CS 259Q: Quantum Computing
  • CS 261: Combinatorial Optimization (CME 310, MS&E 315)
  • CS 265: Randomized Algorithms and Probabilistic Analysis (CME 309)
  • CS 266Z: Robust Algorithms in the Face of Uncertainty
  • CS 270: Modeling Biomedical Systems (BMDS 210)
  • CS 272: Introduction to Biomedical Informatics Research Methodology (BIOE 212, BMDS 212, GENE 212)
  • CS 272H: Methods for Reproducible Population Health and Clinical Research (BMDS 244, EPI 203, HRP 203)
  • CS 273B: Deep Learning in Genomics and Biomedicine (BMDS 273, GENE 236)
  • CS 273C: Cloud Computing for Biology and Healthcare (BMDS 222, GENE 222)
  • CS 273D: Generalization and Causality in Biohealth (STATS 354)

All CS courses · All departments