Document information
- University
- Politecnico di Milano
- Degree programme
- Computer Engineering
- Subject
- Autonomous Agents and Multiagent Systems
- Classification
- Notes · Complete set
- Original format
- Text
- Searchable text
← Back
NotesComplete set
Course summary
Study material for Autonomous Agents and Multiagent Systems, shared by the Studwiz community and reviewed by moderators.
Autonomous Agents and Multiagent SystemsComplete set
Document information
What's included in this study material
Study material for Autonomous Agents and Multiagent Systems, shared by the Studwiz community and reviewed by moderators.
Import quality: text was extracted directly from the original document.
Extracted content from the document
Representative passages recognised in different parts of the material. The full extracted text remains available to search, while this compact preview makes the page easier to read.
Page 1
Autonomous Agents and Multiagent systems Summary of the concepts February 24, 2017 Contents 1 Formal framework 3 1.1 Model of the environment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Model of the agent . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2.1 Operative formalism . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2 Markov Decision Processes 5 2.1 Bellman Equation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 Value-Iteration algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 Partially observable MDP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.4 Multiagent MDP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3 Model of the knowledge 7 4 Cooperative Distributed Problem Solving 8 4.1 Problem decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 4.1.1 Contract Net protocol . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 4.2 Sub-problem solution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 4.3 Distributed Constraint Satisfaction Problems . . . . . . . . . . . . . . . . . . . . . . . . . 8 4.3.1 Filtering and Asynchronous backtracking . . . . . . . . . . . . . . . . . . . . . . . 8 5 Games and Game Theory 11 5.1 Normal form strategic games . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 5.1.1 Solution concepts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 5.1.2 Search for Nash equilibria: Best response dynamics algorithm . . . . . . . . . . . . 12 5.1.3 Search for Nash equilibria: mixed…
Preview
First page of the document.