Topics in Algorithmic Game TheoryModule description #40925 / Version 2
- 6 CP
- Portfolio examination
- Graded
- Winter semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
| Module / Version | #40925 / #2 |
|---|---|
| Validity | SS 2019 – SS 2019 |
| Available language(s) | English |
| Credit points | 6 |
| Person responsible for the module | Brill, Markus |
| Grading | Graded |
| Exam format | Portfolio examination |
| Language(s) of instruction | English |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Softwaretechnik und Theoretische Informatik |
| Academic chair | 34352500 FG Effiziente Algorithmen |
Contact
| Office | TEL 5-1 |
|---|---|
| Contact person | Brill, Markus |
| E-mail address | brill@tu-berlin.de |
| Website | http://www.algo.tu-berlin.de/teaching/ |
Learning outcomes
On successful completion, students will be able to:
- model strategic interaction scenarios as games,
- analyze games via applying solution concepts,
- develop (efficient) algorithms to compute solutions,
- study algorithmic problems from a game-theoretic perspective,
- work independently to gain an understanding of published results and proof methods, and
- communicate the central ideas of research papers to non-experts.
- model strategic interaction scenarios as games,
- analyze games via applying solution concepts,
- develop (efficient) algorithms to compute solutions,
- study algorithmic problems from a game-theoretic perspective,
- work independently to gain an understanding of published results and proof methods, and
- communicate the central ideas of research papers to non-experts.
Content
Algorithmic Game Theory addresses problems at the interface of game theory and computer science. Game theory studies strategic interactions of multiple agents in situations where the well-being of a single agent depends not only on his own actions, but also on the actions of all the other agents.
We discuss fundamental concepts from game theory and investigate algorithmic aspects of solution concepts. Furthermore, we will analyze algorithmic problems from a game-theoretic perspective.
We discuss fundamental concepts from game theory and investigate algorithmic aspects of solution concepts. Furthermore, we will analyze algorithmic problems from a game-theoretic perspective.
Module components
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Topics in Algorithmic Game Theory | Integrated course | Winter semester | [en] | 4 | ISIS |
Workload and credit points
Topics in Algorithmic Game Theory (Integrated course)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance | 15 | 4 h | 60 h |
| Pre/post processing | 15 | 8 h | 120 h |
| 180 h | |||
The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.
Description of teaching and learning methods
Combination of lectures (in the first part of the semester), tutorials, presentations by students (in the latter part of the semester), and classroom discussions.
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Basic knowledge of discrete mathematics, algorithms, and computational complexity. Familiarity with formal proof methods.
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Portfolio examination |
| Type of portfolio examination | 100 points in total |
| Language | English |
Test elements
| Name | Points/Weight | Category | Duration/Extent |
|---|---|---|---|
| (Deliverable assessment) presentation | 40 | oral | 45 min |
| (Examination) Written test | 40 | written | 89 min |
| (Learning process review) oral consultation | 20 | oral | 15 min |
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Winter semester.
Maximum number of participants
The maximum capacity of participants is 16.
Registration procedures
Please see website.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
unavailable
Recommended literature
- N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani. Algorithmic Game Theory. Cambridge University Press, 2007.
- Y. Shoham and K. Leyton-Brown. Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations. Cambridge University Press, 2009.
Assigned programs
This module is not used in any program.
Miscellaneous
Not specified