Titre :

Distributed Algorithm for Egalitarian Matching between Individuals and Activities with Additively Separable Preferences

Auteur(s) :

Morge, Maxime [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Systèmes Multi-Agents et Comportements [SMAC]
Université de Lille
Nongaillard, Antoine [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Systèmes Multi-Agents et Comportements [SMAC]
Université de Lille

Titre de la manifestation scientifique :

2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI)

Ville :

Boston

Pays :

France

Date de début de la manifestation scientifique :

2017-11-06

Éditeur :

IEEE

Discipline(s) HAL :

Informatique [cs]/Système multi-agents [cs.MA]
Informatique [cs]/Modélisation et simulation
Informatique [cs]/Intelligence artificielle [cs.AI]

Résumé en anglais : [en]

We aim at providing a social network such that users form groups to practice together some activities. In this paper, we present a formal framework for coalition formation which is suitable for our usecase. We restrict ...
Lire la suite >We aim at providing a social network such that users form groups to practice together some activities. In this paper, we present a formal framework for coalition formation which is suitable for our usecase. We restrict ourselves to additively separable preferences whose representation is linear with respect to the inputs. We propose here a distributed algorithm which aims at maximizing the egalitarian welfare of the resulting matching. Our experiments shows that: i) this algorithm reaches a better outcome than the classical local search techniques; and ii) the distribution of our algorithm speeds up its runtime.Lire moins >

Langue :

Anglais

Comité de lecture :

Oui

Audience :

Internationale

Vulgarisation :

Non

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL