Skip To Content
Athabasca University
Study Guide
Multiagent Systems (Rev. 4)
Computer Science 667
Unit 3 Multiagent Learning
Computer Science 667
>
Multiagent Systems (Rev. 4)
>
Study Guide
>
Unit 3 Multiagent Learning
>
Section 2
Unit 0 Orientation
Learning Outcomes
Course Outline
Course Materials and Components
How to Approach This Course
Assessment
Suggested Study Schedule
Avoid Academic Misconduct and Plagiarism
Using (Not Abusing) Wikipedia
Unit 1 Foundations
Section 1
Section 2
Section 3
Section 4
Section 5
Section 6
Section 7
Unit 2 Intelligent Agents and Multiagent Systems
Section 1
Section 2
Section 3
Unit 3 Multiagent Learning
Section 1
Section 2
Section 3
Unit 4 Social Choice
Section 1
Section 2
Section 3
Unit 5 Mechanism Design
Section 1
Section 2
Section 3
Unit 6 Multiagent Resource Allocation
Section 1
Section 2
Section 3
Unit 7 Coalition Game
Section 1
Section 2
.
Section 2: Reinforcement Learning (Stochastic Games)
Key Learning Points
Explain the multiagent extensions of learning in MDPs.
Learn about reinforcement learning in zero-sum stochastic games.
Activities
Read section 7.4 of the textbook;
Watch the following video(s):
Stochastic Games
Stochastic Games: Georgia Tech—Machine Learning
Zero-Sum Stochastic Games: Georgia Tech—Machine Learning
Zero-Sum Stochastic Games Two: Georgia Tech—Machine Learning
Stochastic Games and Multiagent RL: Georgia Tech—Machine Learning
Implement Q-learning algorithm for a simple path-finding domain with NetLogo (referring to
José M. Vidal’s site
.)
Updated July 09 2018 by FST Course Production Staff
Feedback
Privacy