AGTA: Algorithmic Game Theory and Applications
AGTA: Algorithmic Game Theory and its Applications
Introduction
Welcome to Algorithmic Game Theory and its Applications (AGTA). This is a 4th year and MSc course that runs in Semester 2 (Spring 2025). The course is all about strategic thinking/reasoning, decision making and the associated computational/algorithmic aspects of it. This is a 4th year and MSc course that runs in Semester 2 (Spring 2025).
Learning Outcomes
On successful completion of this course, you should be able to:
- understand various models of games, how they are related, and how they arise in various applications in computer science and elsewhere
- understand linear programming and some of its broad applicability
- understand how algorithms are used to "solve" such games and their efficiency
- model various scenarios as strategic games, and devise algorithms to solve them
- understand the aims of the current research frontier
(Rough) Course Outline
Games and strategies, solution concepts (equilibria), two-player and multi-player games, zero-sum games, games in normal and extensive form, algorithms for computing equilibria, linear programming basics, congestion games, the price of anarchy, social choice theory, algorithmic mechanism design, bidding auctions, computational complexity of computing equilibria.
The Team
The course organiser and lecturer for AGTA is Aris Filos-Ratsikas. Aris is a Lecturer in Algorithms and Complexity at the School of Informatics, specialising in Algorithmic Game Theory.
The tutor for the course will be Charalampos Kokkalis. Charalampos is a second-year PhD student working in the area of Algorithmic Game Theory.
On behalf of the whole team, we welcome you to the course!
Our first lecture will take place on Monday 13th January at 11.10-12.00 at the Basement Theatre of Adam House.