Multiagent Systems (BE4M36MAS) Winter 2016/2017

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)

All deadlines regarding homework assignments are STRICT !

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 year: PDF

Lectures

(subject to permutation)

Date Topic Lecturer Resources
04 Oct Introduction to multi-agent systems Pechoucek1
11 Oct Belief-Desire-Intention architecture Pechoucek 2
18 Oct Introduction to Game Theory Pechoucek 3
25 Oct Solving Normal-form Games Bošanský 4
1 Nov Games in Extensive Form Bošanský 5
8 Nov Solving Extensive-Form Games Bošanský 6
15 Nov Other Game Representations Bošanský 7
22 Nov Cooperative Game Theory Bošanský 8
29 Nov Distributed constraint reasoning 1 (DCSP) Bošanský 9
6 Dec Distributed constraint reasoning 2 (DCOP) Bošanský 10
13 Dec Social Choice, Voting Bošanský 11
20 Dec Resource allocation and Auctions Bošanský 12
3 Jan Mechanism Design Bošanský 13
10 Jan Multiagent Simulations Bošanský 14

Tutorials

Date Topic Lecturer Resources Old resources
04 Oct Agent architectures Horák architectures.pdf Wumpus' World
11 Oct Belief-Desire-Intention, Jason Horák bdi.pdf miner.asl
18 Oct Assignment 1, Jason Horák advjason.pdf as1-bundle.zip
25 Oct Normal-Form Games Čermák nfg.pdf
1 Nov Extensive-Form Games Čermák efg_intro.pdf
8 Nov Solving Extensive-Form Games Čermák efg_solving.pdf
15 Nov Solving Extensive-Form Games 2 Čermák efg_solving.pdf
22 Nov Other Game Representations Čermák se_and_learning.pdf
29 Nov Cooperative Game Theory Bošanský cv_coop.pdf
6 Dec Distributed constraint satisfaction (DCSP) Horák dcsp.pdf
13 Dec Social Choice, Voting Bošanský cv_voting.pdf
20 Dec Resource Allocation Bošanský cv_resource.pdf
3 Jan Auctions Bošanský cv_auctions.pdf
10 Jan Reserve, Recap Bošanský -none-

Reading Resources

(relevant chapters specified in respective lectures slides)

  • [Vidal] Vidal, J. M.: Fundamentals of Multiagent Systems with NetLogo Examples, 2009,
  • [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

Jason

jason_bundle.zip (If you have some troubles with Jason, you may consider using a VirtualBox machine with Jason preinstalled. Beware that the virtualized environment may behave slightly differently!)

Basic constructs of the language

Jason manual

Jason internal actions

 
Groups:
courses/be4m36mas/start.txt · Last modified: 2017/01/16 09:23 by bosanbra