This page is located in archive.

Multiagent Systems (BE4M36MAS) Winter 2020/2021

The course provides an introduction to concepts, models and algorithms for autonomous agents and multi-agent systems. The first part of the course introduces single-agent models and control architectures; the second, more extensive part explains key multiagent models and algorithms, both for cooperative and non-cooperative multiagent settings. Upon successful completion of the course, students will be able to understand main multi-agent concepts, be able to map real-world multi-agent problems to multiagent formal models and apply algorithmic techniques to solve them.

General Information


Both the course assessment and exam are required to pass the course. The final grade (A..F) will be determined by the sum of points obtained from the assessment and exam (<50 = F, 50-59 pts = E, …, 90-100 pts = A).


Minimum of 20 pts is required from three course miniprojects (out of maximum 40 pts)

  • Agent programming: max grading: 14 pts.
  • Game theory: max grading: 14 pts.
  • Coalitional game theory: max grading: 12 pts.

The penalty for submitting the homework assignment after the deadline, but no later than 24 hours after the deadline, is 20% of the points.

The penalty for submitting the homework assignment later than 24 hours after the deadline is 100% of the points.


Minimum of 30 pts is required from the exam (out of maximum 60 pts).

  • The exam comprises a written part accompanied with a brief oral part. The exam will be written, the discussion about the results of the exam will be via online video-call on on-demand basis.
  • The capacity of one exam slot is limited to 9 students due to COVID, all exams will take part in the lecture hall KN-E301.
  • All health-related measures apply:
    • Safe distance between the students has to be kept during the exam,
    • you can not attend the exam if you are sick, in quarantine, or experiencing acute COVID symptoms,
    • using face-masks and hand sanitizer is mandatory,
    • disinfectants will be also used in the room during the 15 min slot between the exam slots.
  • Exam topics correspond to the topics covered by lecture slides
  • Course assessment is required prior to attending an exam


  • 12.1.2021 (Tue)
    • 9:45 - 11:15
    • 11:30 - 13:00
  • 21.1.2021 (Thu)
    • 9:45 - 11:15
    • 11:30 - 13:00
  • 2.2.2021 (Tue)
    • 9:45 - 11:15
    • 11:30 - 13:00

Exam from the last years: PDF


(subject to permutation)

Date Topic Lecturer Resources Old Resources
22 Sept Introduction to multi-agent systems Pechoucek video mas2018-l01.pdf 1 2
29 Sept Agent Architectures. Belief-Desire-Intention architecture Pechoucek video mas2020-l02.pdf Agent Architectures + BDI
06 Oct Introduction to Game Theory Bošanský video mas_l03_gt_intro_2020.pdf gt_intro_2019.pdf 3
13 Oct Solving Normal-form Games Bošanský video mas_l04_nfgs_2020.pdf nfg_2019.pdf nfg 4
20 Oct Games in Extensive Form Bošanský video mas_l05_efgs_2020.pdf efg_2019.pdf efg_2018 5 efg_2017
27 Oct Solving Extensive-Form Games Bošanský video mas_l06_solving_efgs_2020.pdf solving_efg_2019.pdf solving_efg_2018.pdf solving_efg_2017 6
3 Nov Other Game Representations Bošanský video mas_l07_beyond_efgs_2020.pdf beyond_2019.pdfbeyond_2018.pdf beyond_2017 7
10 Nov Multiagent Resource Allocation Jakob slidesvideo
17 Nov No lecture
24 Nov Auctions 1 Jakob video Auctions 1 auctions_2019.pdfmas2018-l12-auctions.pdf 12
1 Dec Auctions 2 Jakob video Auctions 2
8 Dec Coalitional Games. The Core Kroupa video cg01_lectures.pdf
15 Dec The Shapley value Kroupa video cg02_lectures.pdf
5 Jan The Nucleolus Kroupa video cg03_lectures.pdf
This semester there will be no lecture on social choice due to the official harmonogram of teaching (13 lectures). The basic voting rules and the properties of social choice functions are explained in this presentation.


Date Topic Lecturer Resources Old resources
22 Sept Introduction, Overview of the course Fiedler video tutorial_1.pdf Wumpus' World (solutions)
29 Sept Reactive architectures Fiedler video tutorial_2.pdf bdi.pdf bdi.pdf miner.asl
06 Oct Assignment 1 Fiedler video tutorial_3.pdf miners.pdfadvjason.pdf assignment from previous run
13 Oct Normal-Form Games Šustr, Seitz video mas_nfg_2020.pdf s_cv_nfg_2019.pdfcv_nfg_2018.pdf nfg_cermak_2017.pdf nfg.pdf
20 Oct Extensive-Form Games Šustr, Seitz video cv_efg_2020.pdf cv_efg_2019.pdf cv_efg_2018.pdf cv_nfg_2017.pdf efg_intro.pdf
27 Oct Solving Extensive-Form Games Šustr, Seitz video cv_solving_efg_2019_2.pdf cv_nfg_efg_2017 efg_solving.pdf
3 Nov Solving Extensive-Form Games 2 Šustr, Seitz video cv_solving2_efg_2019.pdfcv_solving_efg_2017 efg_solving.pdf
10 Nov Recap Šustr, Seitz video Simple Poker LPs Video - consultation for the second assignment
17 Nov No lab
24 Nov Auctions 1 Šustr, Seitz video mas2020_auctions1_lab_1_.pdf mas_auctions_lab_2019.pdf
1 Dec Auctions 2 Šustr, Seitz video mas2020_auctions2_lab.pdf cv_resource.pdf auctions_tree.ps cv_auctions_2017.pdf cv_auctions.pdf
8 Dec Coalitional Games. The Core Aradhye video
15 Dec The Shapley Value Aradhye video
5 Jan The Nucleolus Aradhye video cg_exercises.pdf Python code for the nucleolus

Reading Resources

  • [Shoham] Shoham, Y. and Leyton-Brown, K.: Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations, Cambridge University Press, 2008, ISBN 9780521899437.
    • relevant chapters available on-request from Michal Jakob
  • [AIMA] Russel, S. a Norvig, P.: Artificial Intelligence: A Modern Approach (2nd edition), Prentice Hall, 2003
    • relevant chapters available by e-mail request from Michal Jakob
  • [Wooldridge] Wooldridge, M.: An Introduction to MultiAgent Systems, John Wiley & Sons Ltd, 2002, ISBN 0-471-49691-X.
    • relevant chapters available by e-mail request from Michal Jakob

Tutorial Resources

For running IntelliJ Idea on local machines use command /opt/idea-IC-173.4548.28/bin/idea.sh.

courses/be4m36mas/start.txt · Last modified: 2021/01/05 17:19 by seitzdom