Skip to Main content Skip to Navigation
Book sections

Acyclic 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 : Acyclic preference-based systems recently appeared as an elegant way to model many P2P unstructured or hybrid systems. The strength of these systems is a self-stabilizing property that allows to provide analytical results in addition to empirical validation. In this chapter, we give the keys to understand and use acyclic preference-based. After a brief introduction to the roots and notation of the model, the main convergence theorem is exposed and a description of P2P-relevant preferences is given. Ensues an explanation of the combinatory techniques used to refine the convergence study, and a statistical description, based on mean field assumptions, of the stable configurations of acyclic preference-based systems. For some preferences, we observe that the stable configuration is a small-world.
Keywords : P2P Stable Marriages
Document type :
Book sections
Complete list of metadatas
Contributor : Fabien Mathieu <>
Submitted on : Tuesday, February 7, 2012 - 2:43:44 PM
Last modification on : Saturday, March 28, 2020 - 2:13:57 AM




Fabien Mathieu. Acyclic Preference-Based Systems. Shen, Xuemin and Yu, Heather and Buford, John and Akon, Mursalin. Handbook of Peer-to-Peer Networking, Springer US, pp.1165-1203, 2010, 978-0-387-09751-0. ⟨10.1007/978-0-387-09751-0_42⟩. ⟨hal-00667351⟩



Record views