Algorithmic Game Theory 1+2 (Winter 2022/23)
Topical
- Logbook, with details about schedule and material.
- Part 1 ended on Dec 6. Part 2 started on Dec 8.
Organizational
- Lecturers: Prof. Dr. Martin Hoefer, Dr. Giovanna Varricchio
- Exercises: Conrad Schecker
- LSF entries: Part 1, Part 2, Part 1+2
- Lectures:
Tue, 10:15 - 11:45h in Magnus-Hörsaal, Robert-Mayer-Str. 11-15
Thu, 10:15 - 11:45h in H8, Hörsaalgebäude - Exercises: Fri, 10:15 - 11:45h in SR 307, Robert-Mayer-Str. 11-15
- First Exam: Written exam on Feb 16, 2023, 09:00 - 12:00h.
- Second Exam: Oral exams on May 3, 2023.
Material
Slides and Notes
| Chapter | Updates | Lectures | |
|---|---|---|---|
| Organizational | Slides | 18.10.2022 | 1 |
| Part 1: | |||
| Strategic Games and Nash Equilibrium | Slides | 18.10.2022 | 1-3 |
| Pure Nash Equilibria | Slides | 16.11.2022 | 4-8 |
| Learning and Correlated Equilibria | Slides | 23.11.2022 | 8-10 |
| Prices of Anarchy and Stability | Slides | 24.11.2022 | 11-13 |
| Part 2: | |||
| Designing Incentive-Compatible Mechanisms | Slides | 09.12.2022 | 14-17 |
| Social Choice | Slides | 10.01.2023 | 18-21 |
| Fair Division: Cake-Cutting | Notes | 26.01.2023 | 22-23 |
| Fair Division: Indivisible Goods | Notes | 02.02.2023 | 24-25 |
| Hedonic Games | Notes | 07.02.2023 | 26 |
Lecture Notes
German lecture notes from a previous version of this course are available here.Videos
Lectures will be recorded by studiumdigitale and made available here (access via HRZ login).
Exercise Sheets
Weekly exercise sheets will be published here.
Your solutions must be submitted as a single PDF file via SAP.
You need to sign up first: Please send an Email to Conrad Schecker with your full name, your matriculation number and your HRZ mail address.
Part 1:
- Assignment 1. Issued: 25.10.2022. Due: 01.11.2022, 10:00. (TeX Code for Matrices.)
- Assignment 2. Issued: 01.11.2022. Due: 08.11.2022, 10:00.
- Assignment 3. Issued: 08.11.2022. Due: 15.11.2022, 10:00. (TeX Code for Matrices.)
- Assignment 4. Issued: 15.11.2022. Due: 22.11.2022, 10:00.
- Assignment 5. Issued: 22.11.2022. Due: 29.11.2022, 10:00. (TeX Code for Matrices.)
- Assignment 6. Issued: 29.11.2022. Due: 06.12.2022, 10:00. (TeX Code for Matrices.)
- Assignment 7. Issued: 06.12.2022. Due: 13.12.2022, 10:00.
Part 2:
- Assignment 8. Issued: 13.12.2022. Due: 20.12.2022, 10:00.
- Assignment 9. Issued: 20.12.2022. Due: 17.01.2023, 10:00.
- Assignment 10. Issued: 17.01.2023. Due: 24.01.2023, 10:00.
- Assignment 11. Issued: 24.01.2023. Due: 31.01.2023, 10:00.
- Assignment 12. Issued: 31.01.2023. Due: 07.02.2023, 10:00.
Content
The course provides an introduction to theoretical and algorithmic foundations of computer systems that involve strategic and economic interaction of rational agents. These systems arise frequently in modern computer networks -- service providers strive to route packets as quickly or cheap as possible, in cloud computing the resources (such as computing time or memory) are shared, rented or sold, advertisers want to place their ads as prominently as possible and pay as little as possible, etc. The business model of many companies relies on trade and marketing in computational markets on the Internet.
In algorithmic game theory we design and analyze algorithms for systems with interaction of many rational agents. These algorithms search for optimal strategies for single users, or they try to optimize performance for the system while addressing strategic behavior of users. The goals are a characterization of incentives, as well as provable bounds on running time and solution quality for optimization algorithms. In the course, we will introduce basic ideas from game theory and combine them with techniques from approximation algorithms, distributed computing, and complexity theory.
Literature
Directly related to the course material:
- [EK] Easley, Kleinberg. Networks, Crowds, and Markets. Cambridge University Press, 2010.
Access here. - [NRTV] Nisan, Roughgarden Tardos, Vazirani. Algorithmic Game Theory. Cambridge University Press, 2007.
Non-printable PDF here. - [R] Roughgarden. Twenty Lectures in Algorithmic Game Theory. Cambridge University Press, 2016.
- [RBLR] Rothe, Baumeister, Lindner, Rothe. Einführung in Computational Social Choice. Spektrum Verlag, 2012. Access with Goethe University license here.
Many textbooks cover background and context in game theory, e.g.,
- [M] Myerson. Game Theory: Analysis of Conflict. Harvard University Press, 1991.
- [O] Owen. Game Theory. Academic Press, 2001.
- [OR] Osborne, Runbinstein. A Course in Game Theory. MIT Press, 1995.
- etc...