Open multi-agent systems: representation, limitations and decentralized optimization
(2022)
Files
Monnoyer_Thesis.pdf
Open Access - Adobe PDF
- 6.25 MB
Details
- Authors
- Supervisors
- Hendrickx, Julien
- Abstract
- Multi-agent systems are a powerful tool used to model a wide variety of problems involving interconnected independent entities collaborating to achieve some objective. The overwhelming majority of studies based on this model assume the composition of the systems remains constant, and yet at the same time aim for robustness and scalability. In this thesis, we question this assumption by considering open multi-agent systems, subject to arrivals and departures of agents which cannot be neglected. In the first part, we highlight and study general properties of such systems by analyzing the well-known consensus problem and the Gossip algorithm. On the one hand, we propose an appropriate way to represent open systems whose size changes with time, applied to this type of problems. On the other hand, we introduce tools and methods to characterize the performance of algorithms in such systems, whose convergence is prevented by nature. In the second part, we study the behavior of decentralized optimization algorithms solving the resource allocation problem subject to replacements of agents. Using two distinct types of metrics, we analyze the evolution of the error achieved by such algorithms in expectation. In particular, we characterize the noxious influence of replacements on their efficiency and behavior.
- Affiliations
UCLouvain SST/ICTM/INMA - Pôle en ingénierie mathématique
Citations
Monnoyer de Galland de Carnières, C. (2022). Open multi-agent systems: representation, limitations and decentralized optimization. https://hdl.handle.net/2078.5/101405