Distributed Algorithm for Egalitarian Matching between Individuals and Activities with Additively Separable Preferences - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

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

Résumé

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.
Fichier principal
Vignette du fichier
morge17ictai-0.5.pdf (356.94 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01811517 , version 1 (05-11-2020)

Identifiants

Citer

Maxime Morge, Antoine Nongaillard. Distributed Algorithm for Egalitarian Matching between Individuals and Activities with Additively Separable Preferences. 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI), Nov 2017, Boston, France. ⟨10.1109/ICTAI.2017.00117⟩. ⟨hal-01811517⟩
63 Consultations
110 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More