Computational Game Theory

The course cannot be taken simultaneously with:

Computational Game Theory (B4M36MAS)

The course is a substitute for:

Computational Game Theory (B4M36MAS)

Garant předmětu:

Michal Pěchouček

Lecturer:

Branislav Bošanský, Michal Jakob, Tomáš Kroupa, Michal Pěchouček

Tutor:

Branislav Bošanský, Michal Jakob, Tomáš Kroupa, Ondřej Kubíček, Michal Pěchouček, Tomáš Votroubek

Supervisor:

Department of Computer Science

Synopsis:

This course provides a comprehensive overview of game theory, covering both its theoretical foundations and practical applications. Students will learn how to model and analyze strategic interactions between rational agents using strategic form, extensive form, and Bayesian games. They will also learn how to compute equilibria in different game structures and understand the properties and limitations of different equilibrium concepts, such as Nash equilibrium and correlated equilibrium. The course will delve into applications of game theory, including auctions, coalition games, and social choice mechanisms. By the end of the course, students will have a deep understanding of the core concepts of game theory and be equipped with the tools to analyze and design mechanisms for a variety of real-world problems.

Requirements:

Syllabus of lectures:

1. Introduction to Game Theory

2. Normal-Form Games, Solution Concepts

3. Solving Normal-Form Games

4. Extensive Form Games

5. Solving Extensive Form Games

6. Other Game Representations

7. Bayesian Games, Introduction to Auctions

8. Auctions 1

9. Auctions 2

10. Coalitional Games, The Core

11. Shapley Value

12. The Nucleolus

13. Social Choice, Voting

14. Wrap-up

Syllabus of tutorials:

1. Introduction to Game Theory

2. Normal-Form Games, Solution Concepts

3. Solving Normal-Form Games

4. Extensive Form Games

5. Solving Extensive Form Games

6. Other Game Representations

7. Midterm Test

8. Auctions 1

9. Auctions 2

10. Coalitional Games, The Core

11. Shapley Value

12. The Nucleolus

13. Social Choice, Voting

14. Wrap-up

Study Objective:

Study materials:

Shoham, Y. and Leyton-Brown, K.: Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations, Cambridge University Press, 2008, ISBN 9780521899437.

Weiss, G. (eds): Multiagent Systems, second edition, MIT Press, 2013

Vidal, J. M.: Fundamentals of Multiagent Systems with NetLogo Examples, 2009

Note:

Further information:

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

Time-table for winter semester 2022/2023:

	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 09:15–10:45 (lecture parallel1) Karlovo nám. Šrámkova posluchárna K9roomKN:E-307 Kubíček O. Votroubek T. 11:00–12:30 (lecture parallel1 parallel nr.101) Karlovo nám. HW-lab K307roomKN:E-307 Kubíček O. Votroubek T. 14:30–16:00 (lecture parallel1 parallel nr.102) Karlovo nám. HW-lab K307roomKN:E-307 16:15–17:45 (lecture parallel1 parallel nr.103) Karlovo nám. HW-lab K307room 18:00–19:30 (lecture parallel1 parallel nr.104)
Wed
Thu
Fri

Time-table for summer semester 2022/2023:

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)