{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:13:33Z","timestamp":1742912013517,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921561"},{"type":"electronic","value":"9783540921578"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92157-8_15","type":"book-chapter","created":{"date-parts":[[2008,11,29]],"date-time":"2008-11-29T02:54:09Z","timestamp":1227927249000},"page":"170-181","source":"Crossref","is-referenced-by-count":5,"title":["A Method to Derive Local Interaction Strategies for Improving Cooperation in Self-Organizing Systems"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Auer","sequence":"first","affiliation":[]},{"given":"Patrick","family":"W\u00fcchner","sequence":"additional","affiliation":[]},{"given":"Hermann","family":"de Meer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Caro, G.D., Dorigo, M.: AntNet: a mobile agents approach to adaptive routing. Technical Report IRIDIA\/97-12, Universit\u00e9 Libre de Bruxelles, Belgium"},{"key":"15_CR2","unstructured":"Cohen, B.: Incentives build robustness in BitTorrent (2003)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-24679-4_72","volume-title":"Grid and Cooperative Computing","author":"J. Jiang","year":"2004","unstructured":"Jiang, J., Bai, H., Wang, W.: Trust and cooperation in peer-to-peer systems. In: Li, M., Sun, X.-H., Deng, Q.-n., Ni, J. (eds.) GCC 2003. LNCS, vol.\u00a03033, pp. 371\u2013378. Springer, Heidelberg (2004)"},{"key":"15_CR4","unstructured":"Lai, K., Feldman, M., Stoica, Chuang, J.: Incentives for cooperation in peer-to-peer networks. In: Workshop on Economics of Peer-to-Peer Systems (2003)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/1080192.1080199","volume-title":"P2PECON 2005: Proceeding of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems","author":"S. Jun","year":"2005","unstructured":"Jun, S., Ahamad, M.: Incentives in BitTorrent induce free riding. In: P2PECON 2005: Proceeding of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems, pp. 116\u2013121. ACM Press, New York (2005)"},{"key":"15_CR6","volume-title":"The Evolution of Cooperation","author":"R. Axelrod","year":"1984","unstructured":"Axelrod, R.: The Evolution of Cooperation. Basic Books, Inc., Publishers, New York (1984)"},{"key":"15_CR7","volume-title":"The Iterated Prisoner\u2019s Dilemma: 20 Years On","author":"S. Yew Chong","year":"2006","unstructured":"Yew Chong, S., Humble, J., Kendall, G., Li, M., Yao, X.: The Iterated Prisoner\u2019s Dilemma: 20 Years On. In: The Iterated Prisoner\u2019s Dilemma: 20 Years On. World Scientific, Singapore (2006)"},{"key":"15_CR8","unstructured":"Shalizi, C.R.: Causal Architecture, Complexity and Self-Organization in Time Series and Cellular Automata. PhD thesis, University of Wisconsin, Supervisor: Martin Olsson (2001)"},{"key":"15_CR9","unstructured":"Shalizi, C.R., Shalizi, K.L.: Blind construction of optimal nonlinear recursive predictors for discrete sequences. In: AUAI 2004: Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, Arlington, Virginia, United States, pp. 504\u2013511. AUAI Press (2004)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Perkins, C., Bhagwat, P.: Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In: ACM SIGCOMM 1994 Conference on Communications Architectures, Protocols and Applications, pp. 234\u2013244 (1994)","DOI":"10.1145\/190809.190336"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Clausen, T., Jacquet, P.: Optimized link state routing protocol, OLSR (2003)","DOI":"10.17487\/rfc3626"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/ISWPC.2006.1613632","volume-title":"ISWPC 2006: Proceedings of the 1st Internation Symposium on Wireless Pervasive Computing","author":"F. Diamantopoulos","year":"2006","unstructured":"Diamantopoulos, F., Economides, A.A.: A performance study of DSDV-based CLUSTERPOW and DSDV routing algorithms for sensor network applications. In: ISWPC 2006: Proceedings of the 1st Internation Symposium on Wireless Pervasive Computing, pp. 1\u20136. IEEE Press, Los Alamitos (2006)"},{"issue":"5","key":"15_CR13","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/MC.2004.1297243","volume":"37","author":"P.T. Eugster","year":"2004","unstructured":"Eugster, P.T., Guerraoui, R., Kermarrec, A.M., Massoulieacute, L.: Epidemic information dissemination in distributed systems. Computer\u00a037(5), 60\u201367 (2004)","journal-title":"Computer"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11734697_1","volume-title":"Engineering Self-Organising Systems","author":"M. Jelasity","year":"2006","unstructured":"Jelasity, M., Babaoglu, O.: T-Man: Gossip-based overlay topology management. In: Brueckner, S.A., Di Marzo Serugendo, G., Hales, D., Zambonelli, F. (eds.) ESOA 2005. LNCS, vol.\u00a03910. Springer, Heidelberg (2006)"},{"key":"15_CR15","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/514191.514206","volume-title":"ICS 2002: Proceedings of the 16th International Conference on Supercomputing","author":"Q. Lv","year":"2002","unstructured":"Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: ICS 2002: Proceedings of the 16th International Conference on Supercomputing, pp. 84\u201395. ACM, New York (2002)"},{"issue":"3","key":"15_CR16","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1109\/TNET.2006.876186","volume":"14","author":"Z.J. Haas","year":"2006","unstructured":"Haas, Z.J., Halpern, J.Y., Li, L.: Gossip-based ad hoc routing. IEEE\/ACM Trans. Netw.\u00a014(3), 479\u2013491 (2006)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"15_CR17","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. The MIT Press, Cambridge (1994)"},{"key":"15_CR18","doi-asserted-by":"publisher","DOI":"10.1002\/0471791571","volume-title":"Queueing Networks and Markov Chains","author":"G. Bolch","year":"2006","unstructured":"Bolch, G., Greiner, S., de Meer, H., Trivedi, K.S.: Queueing Networks and Markov Chains, 2nd edn. John Wiley & Sons, Inc., Hoboken (2006)","edition":"2"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Rapoport, A., Cammah, A.M.: Prisoner\u2019s Dilemma: A Study in Conflict and Cooperation. University of Michigan Press (1965)","DOI":"10.3998\/mpub.20269"}],"container-title":["Lecture Notes in Computer Science","Self-Organizing Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92157-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:10:17Z","timestamp":1684699817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92157-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921561","9783540921578"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92157-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}