Self-stabilization in preference-based systems

Fabien Mathieu 1, 2
2 GANG - Networks, Graphs and Algorithms
LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications, Inria Paris-Rocquencourt
Abstract : Participants of a decentralized system often use some local ranking informations, for selection of effective collaborations. We say that such systems are preference-based. For most practical types of preferences, such systems converge towards a unique stable configuration. In this paper, we investigate the speed and quality of the convergence process with respect to the model parameters. Our results provide an interesting insight into the design of system parameters, such as the number of connections or the algorithm for choosing new partners.
Mots-clés : P2P Stable Marriages
Type de document :
Article dans une revue
Peer-to-Peer Networking and Applications, Springer, 2008, 1 (2), pp.104--121. 〈10.1007/s12083-008-0009-3〉
Liste complète des métadonnées
Contributeur : Fabien Mathieu <>
Soumis le : lundi 6 février 2012 - 18:21:34
Dernière modification le : vendredi 25 mai 2018 - 12:02:05




Fabien Mathieu. Self-stabilization in preference-based systems. Peer-to-Peer Networking and Applications, Springer, 2008, 1 (2), pp.104--121. 〈10.1007/s12083-008-0009-3〉. 〈hal-00667082〉



Consultations de la notice