Economics and Computation
This course follows Algorithmic Game Theory and covers several topics on mechanism design.
Textbooks & Referenced Lecture Notes
- Twenty Lectures on Algorithmic Game Theory. Tim Roughgarden.
Cambridge University Press. 2016.
Grading policy
- Attendance (10%)
- Assignments (20%)
- Mini-Project (10%)
- Midterm Report/Presentation (30%)
- Final Paper Presentation (30%)
Lectures and assignments
- Review of Game Theory Basics
[slides]
- Social Choice
[slides]
- A Sketch of Nash’s Theorem from Fixed Point Theorems
[slides]
- Auctions & Mechanism Design Basics
[slides]
- Algorithmic Mechanism Design (Knapsack Auctions)
[slides]
- Revenue Maximizing Auctions
[slides]
- Simple Near-Optimal Auctions
[slides]
- Multi-Parameter Mechanism Design
[slides]
- Other Selected Topics
Please feel free to use the slides as long as giving appropriate credit to the author!
Any question is welcome.
Please contact Joseph, Chuang-Chieh Lin (Email to:
josephcclin_AT_gms_tku_edu_tw)
© 2004 Joseph Chuang-Chieh Lin