Module Handbook

  • Dynamischer Default-Fachbereich geändert auf MAT

Course MAT-52-13-K-7

Algorithmic Game Theory (4V+2U, 9.0 LP)

Course Type

SWS Type Course Form CP (Effort) Presence-Time / Self-Study
- K Lecture with exercise classes (V/U) 9.0 CP 186 h
4 V Lecture 56 h
2 U Exercise class (in small groups) 28 h
(4V+2U) 9.0 CP 84 h 186 h


CP, Effort 9.0 CP = 270 h
Position of the semester 1 Sem. irreg.
Level [7] Master (Advanced)
Language [EN] English
Area of study [MAT-OPT] Optimisation
Additional informations
Livecycle-State [NORM] Active


Cooperative Game Theory:
  • games in characteristic function form,
  • solution concepts, e.g. core, Shapley value,
  • complexity of the computation of solution concepts,
  • cost allocation problems,
  • application, e.g. optimization problems in multi-player-situations.

Non-cooperative Game Theory:

  • equilibria, e.g. Nash Equilibria, dominant strategies,
  • complexity of the computation of equilibria,
  • introduction to mechanism design, e.g. truthful mechanisms.


  • N. Nisan, T. Roughgarden, E. Tardos, V. Vazirani: Algorithmic Game Theory,
  • M. J. Osborne, A. Rubinstein: A Course in Game Theory,
  • G. Owen: Game Theory.


Further literature will be announced in the lecture.


Registration for the exercise classes via the online administration system URM (

References to Course [MAT-52-13-K-7]

Module Name Context
[MAT-52-13-M-7] Algorithmic Game Theory P: Obligatory 4V+2U, 9.0 LP