Course Catalogue

View Specification Document | Reading List

The main goal of this course is to highlight the intriguing interplay between computational thinking and foundational principles of game theory. We investigate the mathematical concepts that model strategic interactions between different selfish entities, and we use the algorithmic theory lens in order to analyse the existence and quality of equilibrium solutions, study their computational hardness, and design mechanisms to incentivize desirable behaviour. The rigorous study of these notions gives students the fundamental tools to predict and analyse the outcomes in complex scenarios, fostering a deeper understanding of the underlying incentive structures and decision-making processes that play an important role in many modern, real-life applications, where the Internet has been established as the main platform for computing and interaction.

3 hours per week, organized as: one 2-hour lecture per week and one 1-hour tutorial per week

Algorithmics I (H) (or equivalent)

None

Algorithmics II (H) (or equivalent) is recommended but not required

Final examination 80%

Take-home assessed exercise sets 20%

Reassessments are normally available for all courses, except those which contribute to the Honours classification. Where, exceptionally, reassessment on Honours courses is required to satisfy professional/accreditation requirements, only the overall course grade achieved at the first attempt will contribute to the Honours classification. For non-Honours courses, students are offered reassessment in all or any of the components of assessment if the satisfactory (threshold) grade for the overall course is not achieved at the first attempt. This is normally grade D3 for undergraduate students and grade C3 for postgraduate students. Exceptionally it may not be possible to offer reassessment of some coursework items, in which case the mark achieved at the first attempt will be counted towards the final course grade. Any such exceptions for this course are described below. 

■ Provide students with a good understanding of the foundations of the field of Computational Game Theory (CGT).

■ Engage them into a critical discussion about some of the key game-theoretic concepts used in modern applications within Computer Science and Economics.

■ Expose them to the historical and technical interplay between Computer Science, Mathematics, and Economics, as this is realized through the development of CGT.

■ Give a glimpse into the motivation, toolbox, and the necessary fundamentals of some key research areas within CGT, after which students should feel comfortable to start following the related work on their own.

By the end of this course (conditioned on the list of topics chosen) students will be able to:

■ Compare and evaluate various important equilibrium notions used in game theory analysis; based on that,

■ Create games that have desirable strategic outcomes.

■ Evaluate the computational hardness of finding such equilibria.

■ Familiarize themselves with important results, key mathematical notions, and historical points in the development of (Computational Game Theory; have a critical understanding of their significance within the field and be able to draw new connections between them.

■ Evaluate the loss in performance of a system due to selfish behaviour ("Price of Anarchy")

Understand the concept of learning dynamics in game-playing, such as best-responses or no-regret learning. Evaluate the performance of such dynamics and use them critically, depending on the application, as an alternative to traditional, static equilibrium concepts.

Students must submit at least 75% by weight of the components (including examinations) of the course's summative assessment.