Display language

#40925 / #3

WS 2019/20 - SoSe 2022


Algorithms, Games, and the Internet


Brill, Markus


Schriftliche Prüfung


Fakultät IV

Institut für Softwaretechnik und Theoretische Informatik

34352500 FG Effiziente Algorithmen

No information


TEL 5-1

Brill, Markus


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 of games, - design incentive-compatible mechanisms for various settings, - evaluate algorithmic problems from a game-theoretic perspective, and - evaluate economic problems from an algorithmic perspective.


This course addresses theoretical problems at the interface of game theory and computer science, often inspired by internet applications such as sponsored search, crowdsourcing, and social computing platforms. 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 other agents. We start by discussing fundamental concepts from game theory and investigating algorithmic aspects of solution concepts. Then we analyze internet-inspired algorithmic problems from a game-theoretic perspective. Among the topics to be discussed in this course are algorithmic mechanism design, auction theory, matching markets, crowdsourcing markets, information elicitation, prediction markets, reputation systems, and network games.

Module Components


All Courses are mandatory.

Course NameTypeNumberCycleLanguageSWSVZ
Algorithms, Games, and the InternetIVWiSeEnglish6

Workload and Credit Points

Algorithms, Games, and the Internet (IV):

Workload descriptionMultiplierHoursTotal
270.0h(~9 LP)
Pre/post processing15.010.0h150.0h
Exam preparation1.030.0h30.0h
The Workload of the module sums up to 270.0 Hours. Therefore the module contains 9 Credits.

Description of Teaching and Learning Methods

The course material is presented in lectures. The lectures are accompanied by tutorials.

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

Basic knowledge of discrete mathematics and algorithms. Familiarity with formal proof methods.

Mandatory requirements for the module test application:

No information

Module completion



Type of exam

Written exam




120 min

Duration of the Module

The following number of semesters is estimated for taking and completing the module:
1 Semester.

This module may be commenced in the following semesters:

Maximum Number of Participants

The maximum capacity of students is 40.

Registration Procedures

See website.

Recommended reading, Lecture notes

Lecture notes

Availability:  unavailable


Electronical lecture notes

Availability:  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 Degree Programs

This module is used in the following Degree Programs (new System):

Studiengang / StuPOStuPOsVerwendungenErste VerwendungLetzte Verwendung
This module is not used in any degree program.

Students of other degrees can participate in this module without capacity testing.


No information