Searching Pareto-optimal solutions for the problem of forming and restructuring coalitions in multi-agents systems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Group Decision and Negotiation Année : 2010

Searching Pareto-optimal solutions for the problem of forming and restructuring coalitions in multi-agents systems

Résumé

Coordination is one of the fundamental research issues in distributed artificial intelligence and multi-agent systems. Current multi-agent coalition formation methods present two limits: First, computation must be completely restarted when a change occurs. Second, utility functions of the agents are either global or aggregated. We present a new algorithm to cope with these limits. The first part of this paper presents a coalition formation method for multi-agent systems which finds a Pareto optimal solution without aggregating the preferences of the agents. This protocol is adapted to problems requiring coordination by coalition formation, where it is undesirable, or not possible, to aggregate the preferences of the agents. The second part of this paper proposes an extension of this method enabling dynamic restructuring of coalitions when changes occur in the system.
Fichier principal
Vignette du fichier
PeretoGDNRev3.pdf (182.1 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00370430 , version 1 (24-03-2009)

Identifiants

Citer

Philippe Caillou, Samir Aknine, Suzanne Pinson. Searching Pareto-optimal solutions for the problem of forming and restructuring coalitions in multi-agents systems. Group Decision and Negotiation, 2010, 19 (1), pp.7-37. ⟨10.1007/s10726-009-9183-9⟩. ⟨inria-00370430⟩
544 Consultations
344 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More