Table of Contents

Multiagent Systems (BE4M36MAS) Winter 2018/2019

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

Grading

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).

Assessment

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

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

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

Exam

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

Exam from the last years: PDF

Lectures

(subject to permutation)

Date Topic Lecturer Resources Old Resources
02 Oct Introduction to multi-agent systems, Belief-Desire-Intention architecture Pechoucekmas2018-l01.pdf 1 2
09 Oct Belief-Desire-Intention architecture Pechoucek mas2018-l02.pdf
16 Oct Belief-Desire-Intention architecture Pechoucek logics bdi 2
23 Oct Introduction to Game Theory Pechoucek 3
30 Oct Solving Normal-form Games Horak nfg 4
6 Nov Games in Extensive Form Bošanský efg_2018 5 efg_2017
13 Nov Solving Extensive-Form Games Bošanský solving_efg_2018.pdf solving_efg_2017 6
20 Nov Other Game Representations Bošanský beyond_2018.pdf beyond_2017 7
27 Nov Cooperative Game Theory Jakob mas2018-cooperative_game_theory.pdf cooperative_games
4 Dec Distributed constraint reasoning 1 (DCSP) Bošanský dcsp_2018.pdf 9
11 Dec Distributed constraint reasoning 2 (DCOP) Bošanský 10
18 Dec Social Choice, Voting Jakob Computational Social Choice
1 Jan — canceled —
8 Jan Resource allocation, Auctions, Multiagent Simulations Jakob mas2018-l12-auctions.pdf 12 14

Tutorials

Date Topic Lecturer Resources Old resources
02 Oct Agent architectures Tomášek, Horák architectures.pdf Wumpus' World (solutions)
09 Oct Belief-Desire-Intention Tomášek, Horák bdi.pdf bdi.pdf miner.asl
16 Oct Cooperation of Reactive Agents, Assignment 1 Tomášek, Horák miners.pdf advjason.pdf assignment from previous run
23 Oct Normal-Form Games Šustr, Bošanský cv_nfg_2018.pdf nfg_cermak_2017.pdf nfg.pdf
30 Oct Normal-Form Games 2 Šustr, Bošanský cv_nfg_2017.pdf efg_intro.pdf
6 Nov Extensive-Form Games Šustr, Bošanský cv_efg_2018.pdf cv_nfg_efg_2017 efg_solving.pdf
13 Nov Solving Extensive-Form Games Šustr, Bošanský same as last year cv_solving_efg_2017 efg_solving.pdf
20 Nov Other Game Representations Šustr, Bošanský cv_efg_and_beyond_2018.pdf cv_efg_and_beyond se_and_learning.pdf
27 Nov Cooperative Game Theory Šustr, Tomášek cv_coop cv_coop.pdf
4 Dec Distributed constraint satisfaction (DCSP) Horák, Tomášek dcsp.pdf
11 Dec Resource Allocation Bošanský, Tomášek cv_resource.pdf
18 Dec Social Choice, Voting Šustr, Tomášek cv_voting.pdf
1 Jan — canceled — cv_auctions_2017.pdf cv_auctions.pdf
8 Jan Auctions, Recap Bošanský, Tomášek auctions_tree.ps cv_overview.pdf

Reading Resources

Tutorial Resources