Cooperative game theory - NOPT057
Title: Kooperativní teorie her
Guaranteed by: Department of Applied Mathematics (32-KAM)
Faculty: Faculty of Mathematics and Physics
Actual: from 2023
Semester: summer
E-Credits: 5
Hours per week, examination: summer s.:2/2, C+Ex [HT]
Capacity: unlimited
Min. number of students: unlimited
4EU+: no
Virtual mobility / capacity: no
State of the course: taught
Language: Czech, English
Teaching methods: full-time
Additional information: https://kam.mff.cuni.cz/~cerny/teach/22-23/coop.html
Guarantor: prof. RNDr. Martin Loebl, CSc.
Teacher(s): RNDr. Martin Černý
prof. RNDr. Martin Loebl, CSc.
Opinion survey results   Examination dates   SS schedule   Noticeboard   
Annotation -
Fundamentals of cooperative game theory. In the second part of the semestr, we deal with further topics connected to cooperation of player. It is a free continuation of NDMI098 Algorithmic game theory.
Last update: Balko Martin, doc. RNDr., Ph.D. (05.05.2023)
Aim of the course -

The main purpose of this course is to teach fundamentals of the model of cooperative games. In its second part, we discuss different topics from algorithmic game theory that concern cooperation of players and fairness of solutions.

Last update: Černý Martin, RNDr. (23.01.2023)
Course completion requirements -

Oral examination

Last update: Černý Martin, RNDr. (23.01.2023)
Literature -
  • Hans Peters: Game Theory, A Multi-Leveled Approach. Springer-Verlag Berlin Heidelberg, 2008
  • Noam Nisan, Tim Roughgarden, Eva Tardos, Vijay V. Vazirani: Algorithmic game theory. Cambridge University Press Cambridge, 2007. On-line
  • Tim Roughgarden, Twenty Lectures on Algorithmic Game Theory, Cambridge University Press 2016
  • scientific journals
Last update: Černý Martin, RNDr. (23.01.2023)
Syllabus -
  • Concepts of cooperative game theory (cca 8 lectures)
  • Concepts of fairness (1-2 lectures)
  • Routing games (1-2 lectures)
  • Price of anarchy and regret minimisation (1-2 lectures)
Last update: Černý Martin, RNDr. (23.01.2023)
Entry requirements - Czech

Znalost lineárního programování (například Optimalizační metody ).

Předmět je primárně určen pro studenty magisterských programů teoretická informatika, umělá inteligence a diskrétní modely a algoritmy, ale po předchozí konzultaci s vyučujícím může být vhodný i pro ostatní studenty MFF UK.

Last update: Černý Martin, RNDr. (23.01.2023)
Registration requirements -

The lectures will be scheduled via KAM scheduling (https://www.mff.cuni.cz/cs/kam/vyuka-a-seminare/umluva).

Last update: Černý Martin, RNDr. (23.01.2023)