{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T16:26:07Z","timestamp":1759940767088},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,6,5]],"date-time":"2008-06-05T00:00:00Z","timestamp":1212624000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s12083-008-0009-3","type":"journal-article","created":{"date-parts":[[2008,6,4]],"date-time":"2008-06-04T12:37:24Z","timestamp":1212583044000},"page":"104-121","source":"Crossref","is-referenced-by-count":16,"title":["Self-stabilization in preference-based systems"],"prefix":"10.1007","volume":"1","author":[{"given":"Fabien","family":"Mathieu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,6,5]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/1077464.1077474","volume":"1","author":"K Cechl\u00e1rov\u00e1","year":"2005","unstructured":"Cechl\u00e1rov\u00e1 K, Fleiner T (2005) On a generalization of the stable roommates problem. ACM Trans Algorithms 1(1):143\u2013156","journal-title":"ACM Trans Algorithms"},{"key":"9_CR2","unstructured":"Cohen B (2003) Incentives build robustness in bittorrent. In: P2PECON, Berkeley, June 2003"},{"issue":"1","key":"9_CR3","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.geb.2003.05.003","volume":"48","author":"E Diamantoudi","year":"2004","unstructured":"Diamantoudi E, Miyagawa E, Xue L (2004) Random paths to stability in the roommate problem. Games Econom Behav 48(1):18\u201328, July","journal-title":"Games Econom Behav"},{"issue":"11","key":"9_CR4","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra EW (1974) Self-stabilizing systems in spite of distributed control. Commun ACM 17(11):643\u2013644","journal-title":"Commun ACM"},{"key":"9_CR5","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-stabilization","author":"S Dolev","year":"2000","unstructured":"Dolev S (2000) Self-stabilization. MIT Press, Cambridge"},{"key":"9_CR6","unstructured":"Eddington A (1928) The nature of the physical world. The Gifford Lectures"},{"key":"9_CR7","unstructured":"Fleiner T (2002) Some results on stable matchings and fixed points. Technical report TR-2002-08, Egerv\u00e1ry Research Group, Budapest"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Gai A-T, Lebedev D, Mathieu F, de\u00a0Montgolfier F, Reynier J, Viennot L (2007) Acyclic preference systems in p2p networks. In: Euro-Par, Rennes, 28\u201331 August 2007","DOI":"10.1007\/978-3-540-74466-5_88"},{"key":"9_CR9","unstructured":"Gai A-T, Mathieu F, Reynier J, De\u00a0Montgolfier F (2007) Stratification in P2P networks, application to bittorrent. In: ICDCS, Toronto, 25\u201329 June 2007"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Gai AT, Viennot L (2006) Incentive, resilience and load balancing in multicasting through clustered de bruijn overlay network (prefixstream). In: ICON, Singapore, 13\u201315 September","DOI":"10.1109\/ICON.2006.302673"},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Mon 69:9\u201315","journal-title":"Am Math Mon"},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","volume":"6","author":"R Irving","year":"1985","unstructured":"Irving R (1985) An efficient algorithm for the stable roommates problem. J Algorithms 6:577\u2013595","journal-title":"J Algorithms"},{"issue":"3","key":"9_CR13","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1145\/28869.28871","volume":"34","author":"R Irving","year":"1987","unstructured":"Irving R, Leather P, Gusfield D (1987) An efficient algorithm for the \u201coptimal\u201d stable marriage. J Assoc Comput Mach 34(3):532\u2013543","journal-title":"J Assoc Comput Mach"},{"key":"9_CR14","first-page":"259","volume-title":"SWAT \u201900","author":"RW Irving","year":"2000","unstructured":"Irving RW, Manlove D, Scott S (2000) The hospitals residents problem with ties. In: SWAT \u201900. Springer, London, pp 259\u2013271"},{"issue":"1","key":"9_CR15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1006\/jagm.2002.1219","volume":"43","author":"RW Irving","year":"2002","unstructured":"Irving RW, Manlove DF (2002) The stable roommates problem with ties. J Algorithms 43(1):85\u2013105","journal-title":"J Algorithms"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Kawahara Y, Aoyama T, Morikawa H (2004) A peer-to-peer message exchange scheme for large-scale networked virtual environments. Telecommun Syst 25(3)","DOI":"10.1023\/B:TELS.0000014789.70171.fd"},{"key":"9_CR17","unstructured":"Keller J, Simon G (2003) Solipsis: a massively multi-participant virtual world. In: PDPTA, Las Vegas, June 2003"},{"key":"9_CR18","unstructured":"Lebedev D, Mathieu F, Viennot L, Gai A-T, Reynier J, De Montgolfier F (2007) On using matching theory to understand p2p network design. In: INOC, Spa, 22\u201325 April 2007"},{"key":"9_CR19","unstructured":"LeFessant F, Handurukande S, Kermarrec A, Massoulie L (2004) Clustering in peer-to-peer file sharing workloads. In: IPTPS, La Jolla, 26\u201327 February 2004"},{"key":"9_CR20","unstructured":"Lin Y-J, Guo K, Paul S (2002) Sync-ms: synchronized messaging service for real-time multi-player distributed games. In: ICNP, Paris, 12\u201315 November 2002"},{"key":"9_CR21","first-page":"372","volume-title":"International symposium on stabilization, safety, and security of distributed systems (SSS), LNCS 4838","author":"F Mathieu","year":"2007","unstructured":"Mathieu F (2007) Upper bounds for stabilization in acyclic preference-based systems. In: International symposium on stabilization, safety, and security of distributed systems (SSS), LNCS 4838. Springer, Berlin Heidelberg New York, pp 372\u2013382, November"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Mertens S (2005) Random stable matchings. J Stat Mech Theor Exp P10008, doi: 10.1088\/1742-5468\/2005\/10\/P10008","DOI":"10.1088\/1742-5468\/2005\/10\/P10008"},{"issue":"3","key":"9_CR23","doi-asserted-by":"crossref","first-page":"1441","DOI":"10.1214\/aop\/1176989126","volume":"21","author":"B Pittel","year":"1993","unstructured":"Pittel B (1993) The stable roommates problem with random preferences. Ann Probab 21(3):1441\u20131477","journal-title":"Ann Probab"},{"issue":"6","key":"9_CR24","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"AE Roth","year":"1984","unstructured":"Roth AE (1984) The evolution of the labor market for medical interns and residents: a case study in game theory. J Polit Econ 92(6):991\u20131016","journal-title":"J Polit Econ"},{"issue":"2","key":"9_CR25","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.jet.2005.04.004","volume":"125","author":"AE Roth","year":"2005","unstructured":"Roth AE, Sonmez T, Utku Unver M (2005) Pairwise kidney exchange. J Econ Theory 125(2):151\u2013188, December","journal-title":"J Econ Theory"},{"key":"9_CR26","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume":"2218","author":"A Rowstron","year":"2001","unstructured":"Rowstron A, Druschel P (2001) Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lect Notes Comput Sci 2218:329\u2013350","journal-title":"Lect Notes Comput Sci"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Sripanidkulchai K, Maggs B, Zhang H (2003) Efficient content location using interest-based locality in peer-to-peer systems. In: INFOCOM, San Franciso, 30 March\u2013 3 April 2003","DOI":"10.1109\/INFCOM.2003.1209237"},{"issue":"1","key":"9_CR28","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/0196-6774(91)90028-W","volume":"12","author":"JJM Tan","year":"1991","unstructured":"Tan JJM (1991) A necessary and sufficient condition for the existence of a complete stable matching. J Algorithms 12(1):154\u2013178","journal-title":"J Algorithms"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-008-0009-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12083-008-0009-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-008-0009-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T23:39:24Z","timestamp":1559432364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12083-008-0009-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,5]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["9"],"URL":"https:\/\/doi.org\/10.1007\/s12083-008-0009-3","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,5]]}}}