Mo 14:15h - 15:45h / AH III
Di 14:15h - 15:45h / AH II
|8 April 2014||Peis|
Mi 14:15 - 15:45 / 4017
Mi 16:15 - 17:45 / 4017
|16 April 2014||Schmand / Tönnis|
Exam registration is possible only for students that have registered with ZPA to take the exam or were permitted
by the Prüfungsausschuss. We require active participation in the tutorials.
Please remember to register for the lecture until 18 April.
In algorithmic game theory we study problems that arise in applications involving
the interaction of a large number of rational agents. Typical questions concern the
incentives in such environments - will the agents agree on a common outcome? Is
there more than one such stable outcome, is it "fair" or "efficient"? How can we
adjust the incentives by appropriate means (e.g., payments, taxes, threads of
punishment) to induce socially favorable outcomes?
Traditionally, techniques from microeconomics are used for mathematical formulation and solution of such problems. Recently, however, these problems are arising within computational environments - most prominently on the Internet and in e-commerce - and here ideas from game theory must be combined with approximation algorithms, distributed computing, and computational complexity.
- Basic Concepts from Game Theory
- Congestion Games
- Bargaining Games
- Mechanism Design
- Cooperative Game Theory
- A course on Algorithm Design or Approximation Algorithms (e.g. Effiziente Algorithmen or Operations Research 1)
- Basic understanding of Linear Programming
- No previous knowledge about Game Theory is necessary
- Britta Peis: britta (dot) peis (at) oms (dot) rwth-aachen (dot) de
- Daniel Schmand: daniel (dot) schmand (at) oms (dot) rwth-aachen (dot) de
- Andreas Tönnis: toennis (at) cs (dot) rwth-aachen (dot) de