Algorithms, Games, and the InternetModule description #40925 / Version 3
- 9 CP
- Written exam
- Graded
- Winter semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
| Module / Version | #40925 / #3 |
|---|---|
| Validity | WS 2019/20 – Summer semester 2022 |
| Available language(s) | English |
| Credit points | 9 |
| Person responsible for the module | Brill, Markus |
| Grading | Graded |
| Exam format | Written exam |
| 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 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.
- 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.
Content
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
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Algorithms, Games, and the Internet | Integrated course | Winter semester | [en] | 6 | ISIS |
Workload and credit points
Algorithms, Games, and the Internet (Integrated course)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance | 15 | 6 h | 90 h |
| Pre/post processing | 15 | 10 h | 150 h |
| Exam preparation | 1 | 30 h | 30 h |
| 270 h | |||
The workload of the module adds up to 270 hours. The module therefore comprises 9 credit points.
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 examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Written exam |
| Language | English |
| Duration/Extent | 120 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 40.
Registration procedures
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