On a generalization of the stable roommates problem, ACM Transactions on Algorithms, vol.1, issue.1, pp.143-156, 2005. ,
DOI : 10.1145/1077464.1077474
Incentives build robustness in bittorrent, P2PECON, 2003. ,
Clustering in peer-to-peer file sharing workloads [Fle03] T. Fleiner. The stable b-matching polytope, Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS), pp.149-158, 2003. ,
College Admissions and the Stability of Marriage, The American Mathematical Monthly, vol.69, issue.1, pp.9-15, 1962. ,
DOI : 10.2307/2312726
Stable marriage with incomplete lists and ties, ICALP, pp.443-452, 1999. ,
An efficient algorithm for the stable roommates problem Credible group-stability in many-to-many matching problems, J. of Algorithms, vol.6, pp.577-595, 1985. ,
The structure of stable marriage with indifference, Dis. Appl. Math, vol.122, pp.167-181, 2002. ,
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems, Lecture Notes in Computer Science, p.329, 2001. ,
DOI : 10.1007/3-540-45518-3_18
Efficient content location using interest-based locality in peer-to-peer systems, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), 2003. ,
DOI : 10.1109/INFCOM.2003.1209237
A necessary and sufficient condition for the existence of a complete stable matching, Journal of Algorithms, vol.12, issue.1, pp.154-178, 1991. ,
DOI : 10.1016/0196-6774(91)90028-W
Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche, 2004. ,
BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399 ,