{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:29Z","timestamp":1759638089287},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744658"},{"type":"electronic","value":"9783540744665"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74466-5_88","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T14:54:32Z","timestamp":1188226472000},"page":"825-834","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Acyclic Preference Systems in P2P Networks"],"prefix":"10.1007","author":[{"given":"Anh-Tuan","family":"Gai","sequence":"first","affiliation":[]},{"given":"Dmitry","family":"Lebedev","sequence":"additional","affiliation":[]},{"given":"Fabien","family":"Mathieu","sequence":"additional","affiliation":[]},{"given":"Fabien","family":"de Montgolfier","sequence":"additional","affiliation":[]},{"given":"Julien","family":"Reynier","sequence":"additional","affiliation":[]},{"given":"Laurent","family":"Viennot","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"88_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.: College admissions and the stability of marriage. American Mathematical Monthly\u00a069, 9\u201315 (1962)","journal-title":"American Mathematical Monthly"},{"key":"88_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-44985-X_24","volume-title":"Algorithm Theory - SWAT 2000","author":"R.W. Irving","year":"2000","unstructured":"Irving, R.W., Manlove, D., Scott, S.: The hospitals\/residents problem with ties. In: Halld\u00f3rsson, M.M. (ed.) SWAT 2000. LNCS, vol.\u00a01851, pp. 259\u2013271. Springer, Heidelberg (2000)"},{"issue":"1","key":"88_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/jagm.2002.1219","volume":"43","author":"R.W. Irving","year":"2002","unstructured":"Irving, R.W., Manlove, D.F.: The stable roommates problem with ties. J. Algorithms\u00a043(1), 85\u2013105 (2002)","journal-title":"J. Algorithms"},{"issue":"2","key":"88_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.jet.2005.04.004","volume":"125","author":"A.E. Roth","year":"2005","unstructured":"Roth, A.E., Sonmez, T., Utku Unver, M.: Pairwise kidney exchange. Journal of Economic Theory\u00a0125(2), 151\u2013188 (2005), available at \n                    \n                      http:\/\/ideas.repec.org\/a\/eee\/jetheo\/v125y2005i2p151-188.html","journal-title":"Journal of Economic Theory"},{"key":"88_CR5","unstructured":"Lebedev, D., Mathieu, F., Viennot, L., Gai, A.T., Reynier, J., de Montgolfier, F.: On using matching theory to understand P2P network design. In: INOC (2007)"},{"key":"88_CR6","unstructured":"Meridian Project: \n                    \n                      http:\/\/www.cs.cornell.edu\/People\/egs\/meridian\/"},{"key":"88_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A. Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol.\u00a02218, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"key":"88_CR8","volume-title":"Proc. of the 10th IEEE International Conference on Network Protocols","author":"Y.J. Lin","year":"2002","unstructured":"Lin, Y.J., Guo, K., Paul, S.: Sync-ms: synchronized messaging service for real-time multi-player distributed games. In: Proc. of the 10th IEEE International Conference on Network Protocols, IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"88_CR9","unstructured":"Keller, J., Simon, G.: Solipsis: a massively multi-participant virtual world. In: Intern. Conf. on Parallel and Distributed Techniques and Applications (2003)"},{"key":"88_CR10","doi-asserted-by":"crossref","unstructured":"Kawahara, Y., Aoyama, T., Morikawa, H.: A peer-to-peer message exchange scheme for large-scale networked virtual environments. Telecommunication Systems\u00a025(3) (2004)","DOI":"10.1023\/B:TELS.0000014789.70171.fd"},{"key":"88_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Peer-to-Peer Systems III","author":"F. Fessant Le","year":"2005","unstructured":"Le Fessant, F., Handurukande, S., Kermarrec, A.M., Massouli\u00e9, L.: Clustering in peer-to-peer file sharing workloads. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol.\u00a03279, Springer, Heidelberg (2005)"},{"key":"88_CR12","unstructured":"Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient content location using interest-based locality in peer-to-peer systems. In: INFOCOM (2003)"},{"key":"88_CR13","unstructured":"Cohen, B.: Incentives build robustness in bittorrent. In: P2PECON (2003)"},{"key":"88_CR14","volume-title":"Small Worlds : The Dynamics of Networks between Order and Randomness (Princeton Studies in Complexity)","author":"D.J. Watts","year":"2003","unstructured":"Watts, D.J.: Small Worlds: The Dynamics of Networks between Order and Randomness (Princeton Studies in Complexity). Princeton University Press, Princeton (2003)"},{"key":"88_CR15","unstructured":"Gai, A.T., Mathieu, F., Reynier, J., De Montgolfier, F.: Stratification in P2P networks application to bittorrent. In: ICDCS (2007)"},{"issue":"2","key":"88_CR16","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M.E.J. Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Review\u00a045(2), 167\u2013256 (2003)","journal-title":"SIAM Review"},{"key":"88_CR17","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1145\/1073814.1073871","volume-title":"PODC 2005","author":"A. Allavena","year":"2005","unstructured":"Allavena, A., Demers, A., Hopcroft, J.E.: Correctness of a gossip based membership protocol. In: PODC 2005. Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, pp. 292\u2013301. ACM Press, New York (2005)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2007 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74466-5_88","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:18:12Z","timestamp":1587341892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74466-5_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540744658","9783540744665"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74466-5_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}