Algorithmic Game Theory
| Title | Αλγοριθμική Θεωρία Παιγνίων / Algorithmic Game Theory |
| Code | DWS107 |
| Faculty | Sciences |
| School | Informatics |
| Cycle / Level | 2nd / Postgraduate |
| Teaching Period | Winter |
| Coordinator | Georgios Christodoulou |
| Common | No |
| Status | Active |
| Course ID | 600020699 |
Programme of Study: PMS EPISTĪMĪ DEDOMENŌN KAI PAGKOSMIOU ISTOU (2018 éōs sīmera) PF
Registered students: 3
| Orientation | Attendance Type | Semester | Year | ECTS |
|---|---|---|---|---|
| KORMOS | Elective Courses belonging to the selected specialization | 1 | 1 | 7.5 |
| Academic Year | 2025 – 2026 |
| Class Period | Winter |
| Faculty Instructors |
|
| Weekly Hours | 3 |
| Class ID | 600288833
|
Course Type 2021
Specific Foundation
Mode of Delivery
- Face to face
Digital Course Content
- e-Study Guide https://qa.auth.gr/en/class/1/600288833
- eLearning (Moodle): https://elearning.auth.gr/course/view.php?id=15878
Erasmus
The course is also offered to exchange programme students.
Language of Instruction
- Greek (Instruction)
- English (Examination)
Learning Outcomes
At the end of this course, student will obtain:
Cognitive: specialization in subjects related to the design and analysis of systems with selfish agents:
- a critical awareness of current problems, important concepts
and research issues in the field of algorithmic game theory.
- The ability to quantify the inefficiency of equilibria.
- The ability to formulate mechanism design models for the purpose of
modelling particular applications.
- The ability to use, describe and explain appropriate algorithmic
paradigms and techniques in context of a particular game-theoretic
problem.
- The ability to read, understand and communicate research literature
in the field of algorithmic game theory.
- The ability to recognise potential research opportunities and
research directions.
Skills: useful skills for researchers in subjects related to the design and analysis of systems with selfish agents (study, analyse, writing papers, presentation with slides, video creation, problem solving)
General Competences
- Apply knowledge in practice
- Retrieve, analyse and synthesise data and information, with the use of necessary technologies
- Adapt to new situations
- Make decisions
- Work autonomously
- Work in an international context
- Work in an interdisciplinary team
- Generate new research ideas
- Advance free, creative and causative thinking
Course Content (Syllabus)
- Introduction to Game Theory (Nash equilibrium, Mixed Nash equilibria, Equilibrium computation)
- Introduction to Network Games: Reminder of game theory fundamentals
(with a focus on network games): solution concepts such as Nash
equilibria
- Load balancing games: existence and complexity of equilibria, price
of anarchy.
- Routing games (atomic and non-atomic selfish routing): existence and
complexity of equilibria, price of anarchy, price of stability.
- Introduction to Mechanism Design: Social Choice, Mechanisms with
Money, Dominant Strategies, Characterisations of Incentive
Compatible Mechanisms, Bayesian-Nash Implementation.
- Mechanism Design without Money.
- Combinatorial Auctions (CA): Single-Minded Bidders, Bidding
Languages, Iterative Auctions, Winner Determination,
Applications.
- Profit Maximisation in Mechanism Design.
- Current Topics in Algorithmic Game Theory (Network Creation Games,
Sponsored Search Auctions, Price of Anarchy in Auctions)
Keywords
game theory, algorithms, mechanism design, auctions
Educational Material Types
- Notes
- Slide presentations
- Book
Use of Information and Communication Technologies
Use of ICT
- Use of ICT in Course Teaching
- Use of ICT in Communication with Students
- Use of ICT in Student Assessment
Course Organization
| Activities | Workload | ECTS | Individual | Teamwork | Erasmus |
|---|---|---|---|---|---|
| Lectures | 33 | ✓ | |||
| Reading Assigment | 62 | ✓ | |||
| Tutorial | 6 | ✓ | |||
| Written assigments | 62 | ✓ | |||
| Exams | 62 | ✓ | |||
| Total | 225 |
Student Assessment
Student Assessment methods
- Written Exam with Multiple Choice Questions (Summative)
- Written Exam with Short Answer Questions (Summative)
- Written Exam with Extended Answer Questions (Summative)
- Written Assignment (Summative)
- Oral Exams (Summative)
- Performance / Staging (Summative)
- Written Exam with Problem Solving (Summative)
Bibliography
Additional bibliography for study
Algorithmic Game Theory, N. Nisan, T. Roughgarden, E. Tardos, V.V. Vazirani, Cambridge University Press, 2007
20 Lectures on Algorithmic Game Theory, T. Roughgarden, Cambridge University Press, 2016
Last Update
11-12-2023
