{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T23:59:48Z","timestamp":1740095988966,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642328961"},{"type":"electronic","value":"9783642328978"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32897-8_10","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T08:51:25Z","timestamp":1344847885000},"page":"128-145","source":"Crossref","is-referenced-by-count":1,"title":["A Game Theoretic Approach for Optimal Network Topologies in Opportunistic Networks"],"prefix":"10.1007","author":[{"given":"Nils","family":"Bulling","sequence":"first","affiliation":[]},{"given":"Michael","family":"K\u00f6ster","sequence":"additional","affiliation":[]},{"given":"Matei","family":"Popovici","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Becchetti, L., Clementi, A.E.F., Pasquale, F., Resta, G., Santi, P., Silvestri, R.: Information spreading in opportunistic networks is fast. CoRR abs\/1107.5241 (2011)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","first-page":"52","volume-title":"Logic of Programs","author":"E. Clarke","year":"1981","unstructured":"Clarke, E., Emerson, E.: Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic. In: Engeler, E. (ed.) Logic of Programs 1979. LNCS, vol.\u00a0125, pp. 52\u201371. Springer, Heidelberg (1981)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/863955.863960","volume-title":"Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM 2003","author":"K. Fall","year":"2003","unstructured":"Fall, K.: A delay-tolerant network architecture for challenged internets. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM 2003, pp. 27\u201334. ACM, New York (2003), \n                  \n                    http:\/\/doi.acm.org\/10.1145\/863955.863960"},{"issue":"5","key":"10_CR4","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1109\/TMC.2006.68","volume":"5","author":"M. Felegyhazi","year":"2006","unstructured":"Felegyhazi, M., Hubaux, J.P., Buttyan, L.: Nash equilibria of packet forwarding strategies in wireless ad hoc networks. IEEE Transactions on Mobile Computing\u00a05(5), 463\u2013476 (2006), \n                  \n                    http:\/\/dx.doi.org\/10.1109\/TMC.2006.68","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"10_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman, San Francisco (1979)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Greco, G., Scarcello, F.: Pure nash equilibria: hard and easy games. Journal of Artificial Intelligence Research, 215\u2013230 (2003)","DOI":"10.1145\/846241.846269"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Han, B., Hui, P., Kumar, V.A., Marathe, M.V., Shao, J., Srinivasan, A.: Mobile data offloading through opportunistic communications and social participation. IEEE Transactions on Mobile Computing 99 (PrePrints) (2011)","DOI":"10.1109\/TMC.2011.101"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1145\/1374618.1374652","volume-title":"Proceedings of the 9th ACM International Symposium on Mobile ad Hoc Networking and Computing, MobiHoc 2008","author":"P. Hui","year":"2008","unstructured":"Hui, P., Crowcroft, J., Yoneki, E.: Bubble rap: social-based forwarding in delay tolerant networks. In: Proceedings of the 9th ACM International Symposium on Mobile ad Hoc Networking and Computing, MobiHoc 2008, pp. 241\u2013250. ACM, New York (2008), \n                  \n                    http:\/\/doi.acm.org\/10.1145\/1374618.1374652"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/1090191.1080106","volume":"35","author":"S. Jain","year":"2005","unstructured":"Jain, S., Demmer, M., Patra, R., Fall, K.: Using redundancy to cope with failures in a delay tolerant network. SIGCOMM Comput. Commun. Rev.\u00a035, 109\u2013120 (2005), \n                  \n                    http:\/\/doi.acm.org\/10.1145\/1090191.1080106","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Lilien, L., Kamal, Z., Bhuse, V., Gupta, A.: The concept of opportunistic networks and their research challenges in privacy and security. In: Makki, S., Reiher, P., Makki, K., Pissinou, N., Makki, S. (eds.) Mobile and Wireless Network Security and Privacy, pp. 85\u2013117. Springer US (2007), \n                  \n                    http:\/\/dx.doi.org\/10.1007\/978-0-387-71058-7_5","DOI":"10.1007\/978-0-387-71058-7_5"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Pal, R., Kosta, S., Hui, P.: Settling for less \u2013 a qos compromise mechanism for opportunistic mobile networks. In: Proceeding of the Thirteenth Workshop on MAthematical Performance Modeling and Analysis, MAMA (2011)","DOI":"10.1145\/2160803.2160857"},{"issue":"11","key":"10_CR12","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1109\/MCOM.2006.248176","volume":"44","author":"L. Pelusi","year":"2006","unstructured":"Pelusi, L., Passarella, A., Conti, M.: Opportunistic Networking: Data Forwarding in Disconnected Mobile Ad Hoc Networks. IEEE Communications Magazine\u00a044(11), 134\u2013141 (2006), \n                  \n                    http:\/\/dx.doi.org\/10.1109\/MCOM.2006.248176","journal-title":"IEEE Communications Magazine"},{"issue":"6","key":"10_CR13","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s11276-006-9855-1","volume":"13","author":"S. Zhong","year":"2007","unstructured":"Zhong, S., Li, L.E., Liu, Y.G., Yang, Y.R.: On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretic and cryptographic techniques. Wirel. Netw.\u00a013(6), 799\u2013816 (2007), \n                  \n                    http:\/\/dx.doi.org\/10.1007\/s11276-006-9855-1","journal-title":"Wirel. Netw."}],"container-title":["Lecture Notes in Computer Science","Computational Logic in Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32897-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T21:31:44Z","timestamp":1557178304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32897-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642328961","9783642328978"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32897-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}