Intelligent Multiagent Systems
Providing an overview of the basic principles of multiagent paradigm. Acquainting students with formal approaches to multiagent system specification, knowledge representation, behaviour modeling and interagent communication in order to solve problems related to distributed artificial inteligence.
- discuss the notions of the intelligent agent and multi-agent system
- distinguish basic categories of agents and multi-agent systems
- identify the basic application areas of intelligent agents and multi-agent systems
- apply basic multi-agent paradigms to the real world problem solving
- employ the basics of the game theory to formulate and solve multi-agent problems
- construct simple but functional multi-agent systems
Forms of Teaching
|Type||Threshold||Percent of Grade||Threshold||Percent of Grade|
|Seminar/Project||0 %||20 %||0 %||20 %|
|Mid Term Exam: Written||0 %||35 %||0 %|
|Final Exam: Written||0 %||45 %|
|Exam: Written||0 %||80 %|
Week by Week Schedule
- Distributed artificial intelligence. Multiagent approach. Multiagent systems and intelligent agents. Areas of application. Overview of related areas.
- Rational agents. Optimal decision making. Policy of the agent. Utility function. Markov decision process.
- Distributed constraint satisfaction.
- Introduction to the game theory. Payoff matrix. Solution strategies: maxmin strategy, social wellfare strategy, Pareto optimal strategy, iterative domination strategy, Nash equilibrium.
- Coordination and cooperation games. Characteristic form games and coalition formation.
- Learning in multi-agent systems.
- Representing knowledge of an inteligent agent. Inference. Nonmononotnic reasoning and belief revision. Knowledge and belief. Microtheories.
- Midterm exam
- Multiagent negotiation. Bargaining problem. Axiomatic solution concepts. Strategic solution concepts.
- Task allocation problem. Contracts. Complex deals. Argumentation-based negotiation. Negotiation networks. Network exchange theory.
- Auctions. Valuation function. Simple auctions: English auction, first-price sealed-bid auction, Dutch auction, Vickrey auction, double auction. Combinatorial auctions.
- Voting and mechanism design. Voting problem. Borda count. Groves-Clarke mechnanism. Vickrey-Groves-Clarke mechanism. Distributed mechanism design.
- Coordination using goal and plan hierarchies. TAEMS structure. Generalized partial global planning.
- Nature inspired approaches. Ants and termites. Immune systems.
- Final exam