Display language
To modulepage Generate PDF

#40925 / #2

SS 2019 - SS 2019

English

Topics in Algorithmic Game Theory

6

Brill, Markus

benotet

Portfolioprüfung

Zugehörigkeit


Fakultät IV

Institut für Softwaretechnik und Theoretische Informatik

34352500 FG Effiziente Algorithmen

No information

Kontakt


TEL 5-1

Brill, Markus

brill@tu-berlin.de

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, - study algorithmic problems from a game-theoretic perspective, - work independently to gain an understanding of published results and proof methods, and - communicate the central ideas of research papers to non-experts.

Content

Algorithmic Game Theory addresses problems at the interface of game theory and computer science. 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 all the other agents. We discuss fundamental concepts from game theory and investigate algorithmic aspects of solution concepts. Furthermore, we will analyze algorithmic problems from a game-theoretic perspective.

Module Components

Pflichtgruppe:

All Courses are mandatory.

Course NameTypeNumberCycleLanguageSWSVZ
Topics in Algorithmic Game TheoryIVWiSeEnglish4

Workload and Credit Points

Topics in Algorithmic Game Theory (IV):

Workload descriptionMultiplierHoursTotal
Attendance15.04.0h60.0h
Pre/post processing15.08.0h120.0h
180.0h(~6 LP)
The Workload of the module sums up to 180.0 Hours. Therefore the module contains 6 Credits.

Description of Teaching and Learning Methods

Combination of lectures (in the first part of the semester), tutorials, presentations by students (in the latter part of the semester), and classroom discussions.

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

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

Mandatory requirements for the module test application:

This module has no requirements.

Module completion

Grading

graded

Type of exam

Portfolio examination

Type of portfolio examination

100 Punkte insgesamt

Language

English

Test elements

NamePointsCategorieDuration/Extent
(Deliverable assessment) presentation40oral45 min
(Examination) Written test40written89 min
(Learning process review) oral consultation20oral15 min

Grading scale

Notenschlüssel »Notenschlüssel 3: Fak IV (3)«

Gesamtpunktzahl1.01.31.72.02.32.73.03.33.74.0
100.0pt85.0pt80.0pt75.0pt70.0pt65.0pt60.0pt55.0pt50.0pt45.0pt40.0pt

Test description (Module completion)

No information

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:
Wintersemester.

Maximum Number of Participants

The maximum capacity of students is 16.

Registration Procedures

Please see website.

Recommended reading, Lecture notes

Lecture notes

Availability:  unavailable

 

Electronical lecture notes

Availability:  unavailable

 

Literature

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.

Miscellaneous

No information