Self-stabilization in preference-based systems

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.

[1]  Eiichi Miyagawa,et al.  Random paths to stability in the roommate problem , 2004, Games Econ. Behav..

[2]  Laurent Viennot,et al.  Acyclic Preference Systems in P2P Networks , 2007, Euro-Par.

[3]  Robert W. Irving.  An Efficient Algorithm for the "Stable Roommates" Problem , 1985, J. Algorithms.

[4]  Gwendal Simon,et al.  Solipsis: A Massively Multi-Participant Virtual World , 2003, PDPTA.

[5]  Anne-Marie Kermarrec,et al.  Clustering in Peer-to-Peer File Sharing Workloads , 2004, IPTPS.

[6]  L. Shapley,et al.  College Admissions and the Stability of Marriage , 1962 .

[7]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[8]  Laurent Viennot,et al.  On Using Matching Theory to Understand P2P Network Design , 2006, ArXiv.

[9]  David Manlove,et al.  The Stable Roommates Problem with Ties , 2002, J. Algorithms.

[10]  Stephan Mertens,et al.  Random stable matchings , 2005 .

[11]  Bruce M. Maggs,et al.  Efficient content location using interest-based locality in peer-to-peer systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[12]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[13]  Boris Pittel,et al.  The stable roommates' problem with random preferences , 1993 .

[14]  C. Pearce,et al.  An Efficient Algorithm for the , 1999 .

[15]  A. Eddington.  The Nature of the Physical World , 1928 .

[16]  Katarína Cechlárová,et al.  On a generalization of the stable roommates problem , 2005, TALG.

[17]  David Manlove,et al.  The Hospitals/Residents Problem with Ties , 2000, SWAT.

[18]  A. Roth.  The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory , 1984, Journal of Political Economy.

[19]  Robert W. Irving,et al.  An efficient algorithm for the “optimal” stable marriage , 1987, JACM.

[20]  Jimmy J. M. Tan.  A Necessary and Sufficient Condition for the Existence of a Complete Stable Matching , 1991, J. Algorithms.

[21]  Anh-Tuan Gai,et al.  Incentive, Resilience and Load Balancing in Multicasting through Clustered de Bruijn Overlay Network , 2006, 2006 14th IEEE International Conference on Networks.

[22]  Alvin E. Roth,et al.  Pairwise Kidney Exchange , 2004, J. Econ. Theory.

[23]  Yoshihiro Kawahara,et al.  A Peer-to-Peer Message Exchange Scheme for Large-Scale Networked Virtual Environments , 2002, Telecommun. Syst..

[24]  Robert W. Irving,et al.  An efficient algorithm for the 8.8`Optimal stable marriage , 1987 .

[25]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[26]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[27]  Katherine Guo,et al.  Sync-MS: synchronized messaging service for real-time multi-player distributed games , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[28]  Fabien Mathieu,et al.  Upper Bounds for Stabilization in Acyclic Preference-Based Systems , 2007, SSS.

[29]  Fabien Mathieu,et al.  Stratification in P2P Networks: Application to BitTorrent , 2006, ICDCS.