back to search

Algorithmic Game Theory

IN2239Elective Modules Informatics5 ECTSEnglishsummer semesterDepartment Computer Science
AI-edited module sheet. Based on the TUMonline module description, edited for readability.Original in TUMonline

What it is about

You will learn the fundamentals of algorithmic game theory at the intersection of computer science, mathematics, and economics. In this module you will deal with algorithmic aspects of game-theoretic solution concepts such as Nash equilibria and with the design of economic mechanisms; in the end you will be able to analyze these concepts algorithmically and in terms of complexity theory.

What you will be able to do

  • Understand the fundamentals of algorithmic game theory
  • Analyze different representations of n-player games
  • Compute and compare different solution concepts
  • Investigate solution concepts from a complexity-theoretic perspective
  • Analyze and outline simple algorithms for determining game-theoretic solutions

What the module consists of

  • VorlesungConveying the content in lectures and through presentations
  • ÜbungDiscussion and review of solution paths for regularly provided exercise sheets

Teaching method

  • Vortrag/Präsentationfor introduction and explanation of lecture content
  • Übungsblätter und Übungsveranstaltungfor independent work and discussion of solution methods
No dates in the current semester
There are no course dates for this module this semester, or they haven't been matched yet.

Module ratings

No ratings for this module yet.

Rate this module

Only fill in the categories you can judge – for each one, either stars and text together or nothing at all.

Lecture
Tutorial
Exam

Official page in TUMonline · Details are not binding.