Advanced Modern Algorithmic Game Theory - NOPT022

• Title: Pokročilé algoritmy moderní teorie her
• Guaranteed by: Department of Applied Mathematics (32-KAM)
• Faculty: Faculty of Mathematics and Physics
• Actual: from 2025
• 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
• Guarantor: prof. RNDr. Martin Loebl, CSc.
• Teacher(s): Mgr. Radovan Haluška; Mgr. Martin Schmid, Ph.D.
• Class: Informatika Mgr. - Diskrétní modely a algoritmy
• Classification: Informatics > Optimalization

Annotation

English

This course covers advanced algorithms for solving large-scale games using approximation. We'll examine modern approaches like Neural Fictitious Self-Play, Policy Space Response Oracles, Regularized Nash Dynamics, and advanced Counterfactual Regret Minimization variants. Search techniques for perfect/imperfect information games (e.g., Monte Carlo Tree Search, Continual Resolving), utilized in systems like AlphaZero and DeepStack, are also explored. The course combines theoretical foundations with practical Python implementation.

Last update: Maxová Jana, RNDr., Ph.D. (22.05.2025)

Czech

Tento kurz se zabývá pokročilými algoritmy pro řešení rozsáhlých her pomocí aproximace. Zaměříme se na moderní přístupy, jako jsou Neural Fictitious Self-Play, Policy Space Response Oracles, Regularized Nash Dynamics a pokročilé varianty Counterfactual Regret Minimization. Prozkoumáme také vyhledávací techniky pro hry s dokonalou i nedokonalou informací (např. Monte Carlo Tree Search, Continual Resolving), které se využívají v systémech jako AlphaZero a DeepStack. Kurz kombinuje teoretické základy s praktickou implementací v jazyce Python.

Last update: Maxová Jana, RNDr., Ph.D. (22.05.2025)

Course completion requirements

English

Oral exam.

Last update: Maxová Jana, RNDr., Ph.D. (24.04.2025)

Czech

Ústní zkouška.

Last update: Maxová Jana, RNDr., Ph.D. (26.04.2025)

Literature

English

[1] Nisan, Noam, Tim Roughgarden, Éva Tardos, and Vijay V. Vazirani. ‘Algorithmic Game Theory’. Cambridge University Press, 2007.

[2] Albrecht, Stefano V., Filippos Christianos, and Lukas Schäfer. ‘Multi-Agent Reinforcement Learning: Foundations and Modern Approaches’. MIT Press, 2024.

[3] Schmid, Martin. ‘Search in Imperfect Information Games’. ArXiv abs/2111.05884 (2021).

Last update: Maxová Jana, RNDr., Ph.D. (07.04.2025)

Czech

[1] Nisan, Noam, Tim Roughgarden, Éva Tardos, and Vijay V. Vazirani. ‘Algorithmic Game Theory’. Cambridge University Press, 2007.

[2] Albrecht, Stefano V., Filippos Christianos, and Lukas Schäfer. ‘Multi-Agent Reinforcement Learning: Foundations and Modern Approaches’. MIT Press, 2024.

[3] Schmid, Martin. ‘Search in Imperfect Information Games’. ArXiv abs/2111.05884 (2021).

Last update: Maxová Jana, RNDr., Ph.D. (22.05.2025)

Requirements to the exam

English

Oral exam, requirements according to the sylabus of the lecture.

Last update: Maxová Jana, RNDr., Ph.D. (24.04.2025)

Czech

Ústní zkouška, požadavky rozsahem odpovídají sylabu přednášky.

Last update: Maxová Jana, RNDr., Ph.D. (26.04.2025)