Computational Game Theory

Relations:

It is not possible to register for the course BE4M36MAS if the student is concurrently registered for or has already completed the course B4M36MAS (mutually exclusive courses).

During a review of study plans, the course B4M36MAS can be substituted for the course BE4M36MAS.

It is not possible to register for the course BE4M36MAS if the student is concurrently registered for or has previously completed the course B4M36MAS (mutually exclusive courses).

Course guarantor:

Michal Pěchouček

Lecturer:

Michal Jakob, Tomáš Kroupa, Ondřej Kubíček, Tomáš Votroubek

Tutor:

Michal Jakob, Tomáš Kroupa, Ondřej Kubíček, Tomáš Votroubek

Supervisor:

Department of Computer Science

Synopsis:

This course is designed to introduce students to the fundamental concepts and applications of game theory, a powerful tool used to model strategic interactions among individuals, organizations, or countries. Throughout the course, we will delve into various aspects of game theory and explore its wide-ranging applications in diverse fields, including machine learning and AI.

Requirements:

- programming in Python

- optimization, in particular linear programming basics

- linear algebra

- probability and statistics

- discrete mathematics

Syllabus of lectures:

1. Introduction. Normal-form games.

2. Nash equilibria for normal-form games.

3. Tractable classes of games. Learning in games.

4. Extensive-form games.

5. Solving imperfect information EFGs.

6. Alternatives to NE.

7. Bayesian games

8. Auctions 1.

9. Auctions 2.

10. Coalitional games. The core.

11. The Shapley value.

12. Weighted voting games.

13. Games in computer science and ML.

14. Summary.

Syllabus of tutorials:

1. Introduction. Normal-form games.

2. Nash equilibria for normal-form games.

3. Tractable classes of games. Learning in games.

4. Extensive-form games.

5. Solving imperfect information EFGs.

6. Alternatives to NE.

7. Bayesian games

8. Auctions 1.

9. Auctions 2.

10. Coalitional games. The core.

11. The Shapley value.

12. Weighted voting games.

13. Games in computer science and ML.

14. Summary.

Study Objective:

By the end of the course, you will be equipped with the knowledge and skills to analyze complex strategic situations, evaluate fairness of allocation mechanisms, and appreciate the exciting applications of game theory in AI.

Study materials:

Shoham, Y. and Leyton-Brown, K.: Multiagent Systems. Cambridge University Press, 2008.

Maschler, M., Zamir, S., and Solan, E. Game Theory. Cambridge University Press, 2020.

Kochenderfer M.J., Wheeler T.A., Wray K.H. Algorithms for decision making. MIT press, 2022.

https://cw.fel.cvut.cz/b231/_media/courses/cgt/cgt_exercises.pdf

Note:

Further information:

https://cw.fel.cvut.cz/wiki/courses/cgt

Time-table for winter semester 2024/2025:

	06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon
Tue	roomKN:E-301 Kroupa T. 09:15–10:45 (lecture parallel1) Karlovo nám. roomKN:E-307 Kubíček O. Votroubek T. 11:00–12:30 (lecture parallel1 parallel nr.101) Karlovo nám. roomKN:E-307 Kubíček O. Votroubek T. 14:30–16:00 (lecture parallel1 parallel nr.102) Karlovo nám. roomKN:E-307 Kubíček O. Votroubek T. 16:15–17:45 (lecture parallel1 parallel nr.103) Karlovo nám. room 18:00–19:30 (lecture parallel1 parallel nr.104)
Wed
Thu
Fri

Time-table for summer semester 2024/2025:

Time-table is not available yet

The course is a part of the following study plans:

• Open Informatics - Artificial Intelligence (compulsory course of the specialization)