Algorithmic game theory
computer science
about this course
What connects routing in computer networks to IPL player auctions? What connects dynamic pricing of flights to arms control negotiations? It turns out all of these scenarios are where there are sequences of decisions to be made. Decisions that are driven by some rationale: enhance efficiency of networks, get the best players at lowest price, sell all flights tickets at high prices, etc.
Game Theory is the mathematics of decision making that demystifies the complex logic of such interactions. It remains one of the most fundamental concepts in economics; in fact, multiple game theorists have won the Economics Nobel Prize, the most famous being perhaps John Nash.
With high-stakes trading and the rise of multi-agent AI, modern game theory has a particularly computational flavour, that requires not only a mathematical understanding of decision making, but also to compute those decisions quickly.
This course is designed for computer science students with an interest in real-world algorithms and economics students with an interest in the computational aspects of the subject. It will cover classical topics and then give an overview of modern trends.
in these programmes
- computer science
elective · 4-year major, 4-year double major, 3-year major, 3-year double major, 4-year minor, 3-year minor
planning & teaching
before this
No prerequisites.
recently taught by
- Abhishek DeAssistant Professor, Computer Science
Recorded in 2026 T1. Instructors may change.