Algorithmic Game Theory
University of British Columbia, Winter 2016 Term 1
Staff and Office Hours
Office hours: After every lecture, in the lecture room (or my office), 3:30-4pm
Unfortunately there's no TA..
- Algorithmic Game Theory edited by Noam Nisan, Tim Roughgarden, Eva Tardos and Vijay Vazirani
- Microeconomic Theory by Andreu Mas-Colell and Michael Whinston.
- Twenty Lectures on Algorithmic Game Theory by Tim Roughgarden
Homework and Exams
We introduce basic concepts in game theory and study their interactions with computation and algorithms. Some emphasis will be on mechanism/market design; we also discuss other topics such as the inefficiency of equilibria, learning in games etc., depending on time and progress.
We will make use of basic algorithms, theory of computation, and optimization techniques such as linear programming. Mathematical maturity supersedes most concrete prerequisites. No background in economics will be assumed.
- There will be four problem sets and a final exam. For most problems, students are asked to give mathematical proofs.
- Students may work on homework in groups of up to 3 people. Each
group may turn in a single solution set that applies to all members of the
group. However, students are asked to understand each of their group's
solutions well enough to give an impromptu white-board presentation of
- The final is a take-home, non-cooperative exam. Students are asked to solve the problems independently.
Discussion Forum (Piazza)
- Your course grade will be based on the homework and exams. The weights are 60% for homework and 40% for the final exam.
- Students are highly encouraged to typeset their solutions for the homework problem sets and the final exam.
We will be using Piazza
as an online discussion forum for the class. This allows for an open
discussion of questions related to CPSC 536F, visible to the
instructor and the other students in the course. You will
need to register as a student in the course by visiting