====== 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 ===== * Lectures: Tuesday 9:15-10:45 (KN:E-301), 2.10.2018--8.1.2019 * Lecturers: [[http://cs.felk.cvut.cz/en/people/pechouce|Michal Pěchouček]], [[http://cs.felk.cvut.cz/en/people/bosanbra|Branislav Bošanský]], [[http://cs.felk.cvut.cz/en/people/jakobmic|Michal Jakob]] * Tutorials: Tuesday 11:00-12:30, 14:30-16:00, 16:15-17:45 (all in KN:E-307) 2.10.2018--8.1.2019 * Tutors: [[http://cs.felk.cvut.cz/en/people/bosanbra|Branislav Bošanský]], [[http://cs.felk.cvut.cz/en/people/horakka5|Karel Horák]], [[http://cs.felk.cvut.cz/en/people/sustrmic|Michal Šustr]], [[http://cs.felk.cvut.cz/en/people/tomaspe7|Petr Tomášek]] * Office hours: upon request ===== Links ===== * [[http://cw.felk.cvut.cz/upload/|Upload System]] * [[https://goo.gl/FRtY4g|On line quizzes]] ===== 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) * **[[courses:be4m36mas:assignment1-miners|1st course miniproject]]** (agent programming): max grading: 11 pts., due: **7.11.2018 4:00** * **[[courses:be4m36mas:assignment2-game|2nd course miniproject]]** (game theory): max grading: 17 pts., report due: 28.11.2018 4:00 CET **5.12.2018 4:00**, final due: 12.12.2018 4:00 CET **16.12.2018 4:00** (these are the firm deadlines) * **[[courses:be4m36mas:assignment3-dcsp|3rd course miniproject]]** (distributed constraint satisfaction): max grading: 12 pts., due: **3.1.2019 4:00** 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). * The exam comprises a written part accompanied with a brief oral part. * Exam topics correspond to the topics covered by lecture slides * Course assessment is required prior to attending an exam Exam from the last years: {{:courses:be4m36mas:040216.pdf|PDF}} ===== Lectures ===== (subject to permutation) ^ Date ^ Topic ^ Lecturer ^ Resources ^ Old Resources ^ |02 Oct |Introduction to multi-agent systems, Belief-Desire-Intention architecture |Pechoucek|{{ :courses:be4m36mas:mas2018-l01.pdf |}} | {{:courses:be4m36mas:mas2016-l01-introduction.pdf|1}} {{:courses:be4m36mas:mas2016-l02-architectures.pdf|2}} | |09 Oct | Belief-Desire-Intention architecture | Pechoucek | {{ :courses:be4m36mas:mas2018-l02.pdf |}} | | |16 Oct | Belief-Desire-Intention architecture |Pechoucek |{{:courses:be4m36mas:mas_logic_2017.pdf|logics}} {{:courses:be4m36mas:bdi.pdf|bdi}}| {{:courses:be4m36mas:mas2016-l02-architectures.pdf|2}} | |23 Oct | Introduction to Game Theory | Pechoucek | | {{:courses:be4m36mas:mas2016-l03-gt-intro.pdf|3}} | |30 Oct | Solving Normal-form Games |Horak | {{:courses:be4m36mas:nfg2.pdf|nfg}} | {{:courses:be4m36mas:4.pdf|4}}| |6 Nov | Games in Extensive Form |Bošanský | {{ :courses:be4m36mas:efg_2018.pdf|efg_2018}} | {{:courses:be4m36mas:5.pdf|5}} {{:courses:be4m36mas:efg_2017.pdf|efg_2017}}| |13 Nov | Solving Extensive-Form Games |Bošanský | {{ :courses:be4m36mas:solving_efg_2018.pdf |}} | {{:courses:be4m36mas:solving_efg_2017.pdf|solving_efg_2017}} {{:courses:be4m36mas:6.pdf|6}}| |20 Nov | Other Game Representations |Bošanský | {{ :courses:be4m36mas:beyond_2018.pdf |}} | {{:courses:be4m36mas:beyond_2017.pdf|beyond_2017}} {{:courses:be4m36mas:7.pdf|7}}| |27 Nov | Cooperative Game Theory | Jakob |{{ :courses:be4m36mas:mas2018-cooperative_game_theory.pdf |}} | {{:courses:be4m36mas:mas2017-cooperative_games.pdf|cooperative_games}}| |4 Dec | Distributed constraint reasoning 1 (DCSP) | Bošanský | {{ :courses:be4m36mas:dcsp_2018.pdf |}} | {{:courses:be4m36mas:9.pdf|9}} | |11 Dec | Distributed constraint reasoning 2 (DCOP) | Bošanský | | {{:courses:be4m36mas:10.pdf|10}} | |18 Dec |Social Choice, Voting | Jakob | {{ :courses:be4m36mas:mas2018-l11-social_choice.pdf|Computational Social Choice}}|| |1 Jan | --- canceled --- | | | | |8 Jan | Resource allocation, Auctions, Multiagent Simulations | Jakob |{{ :courses:be4m36mas:mas2018-l12-auctions.pdf |}} | {{:courses:be4m36mas:12.pdf|12}} {{:courses:be4m36mas:14.pdf|14}}| ===== Tutorials ===== ^ Date ^ Topic ^ Lecturer ^ Resources ^ Old resources ^ |02 Oct | Agent architectures | Tomášek, Horák | {{courses:be4m36mas:architectures.pdf|}} [[http://wigsoft.cz/ctu/mas/wumpus|Wumpus' World]] ([[http://wigsoft.cz/ctu/mas/wumpus/solutions.html|solutions]]) | | |09 Oct | Belief-Desire-Intention | Tomášek, Horák | {{courses:be4m36mas:bdi2017.pdf|bdi.pdf}} | {{courses:be4m36mas:bdi.pdf|}} {{courses:be4m36mas:miner.asl.txt|miner.asl}} | |16 Oct | Cooperation of Reactive Agents, Assignment 1 | Tomášek, Horák | {{courses:be4m36mas:miners.pdf|}} | {{courses:be4m36mas:advjason.pdf|}} {{courses:be4m36mas:as1-bundle.zip|assignment from previous run}} | |23 Oct | Normal-Form Games | Šustr, Bošanský | {{ :courses:be4m36mas:cv_nfg_2018.pdf |}} | {{:courses:be4m36mas:nfg_cermak_2017.pdf|}} {{:courses:be4m36mas:nfg.pdf|}} | |30 Oct | Normal-Form Games 2 | Šustr, Bošanský | | {{:courses:be4m36mas:cv_nfg_2017.pdf|}} {{:courses:be4m36mas:efg_intro.pdf|}} | |6 Nov | Extensive-Form Games | Šustr, Bošanský | {{ :courses:be4m36mas:cv_efg_2018.pdf |}}| {{:courses:be4m36mas:cv_nfg_efg.pdf|cv_nfg_efg_2017}} {{:courses:be4m36mas:efg_solving.pdf|}} | |13 Nov | Solving Extensive-Form Games | Šustr, Bošanský | same as last year | {{:courses:be4m36mas:cv_solving_efg.pdf|cv_solving_efg_2017}} {{:courses:be4m36mas:efg_solving.pdf|}} | |20 Nov | Other Game Representations | Šustr, Bošanský | {{ :courses:be4m36mas:cv_efg_and_beyond_2018.pdf |}} | {{:courses:be4m36mas:cv_efg_and_beyond.pdf|cv_efg_and_beyond}} {{:courses:be4m36mas:se_and_learning.pdf|}} | |27 Nov | Cooperative Game Theory | Šustr, Tomášek | | {{:courses:be4m36mas:cv_coop_2017.pdf|cv_coop}} {{:courses:be4m36mas:cv_coop.pdf|}} | |4 Dec | Distributed constraint satisfaction (DCSP) | Horák, Tomášek | | {{:courses:be4m36mas:dcsp.pdf|}} | |11 Dec | Resource Allocation | Bošanský, Tomášek | | {{:courses:be4m36mas:cv_resource.pdf|}} | |18 Dec | Social Choice, Voting | Šustr, Tomášek | | {{:courses:be4m36mas:cv_voting.pdf|}} | |1 Jan | --- canceled --- | | | {{:courses:be4m36mas:cv_auctions_2017.pdf|}} {{:courses:be4m36mas:cv_auctions.pdf|}}| |8 Jan | Auctions, Recap | Bošanský, Tomášek | {{:courses:be4m36mas:auctions_tree.ps|}} | {{:courses:be4m36mas:cv_overview.pdf|}} | ===== Reading Resources ===== * [Shoham] Shoham, Y. and Leyton-Brown, K.: Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations, Cambridge University Press, 2008, ISBN 9780521899437. * available [[http://www.masfoundations.org/download.html|on-line]] * [Weiss] [[http://mitpress.mit.edu/books/multiagent-systems-1|Weiss, G. (eds): Multiagent Systems, second edition, MIT Press, 2013]] * 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 =====