This course aims to introduce you to the fundamental concepts of game theory and mechanism design. Game theory, besides being of fundamental mathematical interest, is a main tool to model economic and strategic situations and then study the behavior of rational agents in such situations. Mechanism design is the study of how to design games (such as auctions) so that agents have incentive to act in a desirable way, e.g. by telling the truth. This course will improve your ability to model and analyze economics situations in a mathematical way. We will study the way rational agents will play games, based on their assumptions about the rationality of other agents. We will learn about the concept of Nash equilibria, which are solutions to games that no rational agent has an incentive to deviate from, and learn how to compute these.
In the second part of the course we turn to the problem of social choice, namely choosing from a set of alternatives, given the preferences of a set of players. We will see that many desirable properties of social choice functions cannot be satisfied, and then turn to ways to deal with this issue. The first way is to introduce payments and money-valued preferences, which leads to auction theory and related topics. Here students will learn how to design auctions and other economic mechanisms so that players have no incentive to lie, and to learn how to compute expected revenues. Secondly, we will consider mechanisms that do not allow payments, and study the ways manipulations by the players can be limited in this case. In the second part of the course students will learn how to design economic mechanisms that have certain properties (if possible), and how to judge economic mechanisms, as well as to apply Bayesian reasoning to compute expected outcomes.
The course is aimed at 3rd and 4th year students interested in economics, mathematical modelling, and applied math in general.
- AUs
- 4.0 AUs
- Grade Type
- None
- Exam
- 1 December 2026, 5.00 pm - 7.00 pm
The Exam information shown may be subject to changes. Students are to check the finalised exam timetable with exam seat information, which will be available at the 'Examination Seating Arrangement' webpage, 2 weeks before start of examination.
Prerequisite graph
Computational Economics
Unlocks
Available indexes
| Mon | Tue | Wed | Thu | Fri | |
|---|---|---|---|---|---|
| 1330 | COMMON LEC (LE) 1330-1420 Thu SPMS-LT4 | ||||
| 1400 | |||||
| 1430 | COMMON LEC (LE) 1430-1620 Mon SPMS-LT2 | 70306 TUT (T) 1430-1520 Thu SPMS-LT4 | |||
| 1500 | |||||
| 1530 | |||||
| 1600 |
Other offerings
Other relevant mods
Planning guides
View all articlesBDE · 17 min read
Complete NTU BDE List: Every BDE Category and Module (AY2026/2027 Semester 2)
A complete NTU BDE list by category: languages, business, computing, humanities, arts, science, engineering, and more. Updated for AY2026/2027 Semester 2. Browse all 780+ BDE modules on NTUMods.
STARS · 9 min read
How to Bid for a BDE at NTU (STARS Registration Guide)
Step-by-step: how NTU STARS bidding works, what to do in Round 1 vs Round 2, and how to still get your BDE during add/drop if your first choice fills up.
STARS · 9 min read
NTU STARS Guide 2026: Registration Rounds, Bidding & Planner Tips
NTU STARS planner guide — how bidding rounds work, how to prepare a shortlist before registration opens, and what to do when a module fills up. Includes a free STARS planner tool.